4OR

2016 - 2025

Current editor(s): Yves Crama, Michel Grabisch and Silvano Martello

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 20, issue 4, 2022

Moderate exponential-time algorithms for scheduling problems pp. 533-566

Vincent T’kindt, Federico Della Croce and Mathieu Liedloff

Cross Malmquist Productivity Index in Data Envelopment Analysis pp. 567-602

Ali Homayoni, Reza Fallahnejad and Farhad Hosseinzadeh Lotfi

The grid based approach, a fast local evaluation technique for line planning pp. 603-635

Evert Vermeir, Javier Durán-Micco and Pieter Vansteenwegen

An iterative solution technique for capacitated two-stage time minimization transportation problem pp. 637-684

Fanrong Xie and Zuoan Li

A study on sequential minimal optimization methods for standard quadratic problems pp. 685-712

Riccardo Bisori, Matteo Lapucci and Marco Sciandrone

A note on the complexity of the bilevel bottleneck assignment problem pp. 713-718

Dennis Fischer, Komal Muluk and Gerhard J. Woeginger

Volume 20, issue 3, 2022

Home health care routing and scheduling problems: a literature review pp. 351-389

Jalel Euchi, Malek Masmoudi and Patrick Siarry

Measures of balance in combinatorial optimization pp. 391-415

Philippe Olivier, Andrea Lodi and Gilles Pesant

Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints pp. 417-442

Tadeusz Antczak

A note on ELECTRE TRI-nB with few limiting profiles pp. 443-463

Denis Bouyssou, Thierry Marchant and Marc Pirlot

Partition-based distributionally robust optimization via optimal transport with order cone constraints pp. 465-497

Adrián Esteban-Pérez and Juan M. Morales

Simple ranking method using reference profiles: incremental elicitation of the preference parameters pp. 499-530

Arwa Khannoussi, Alexandru-Liviu Olteanu, Christophe Labreuche and Patrick Meyer

Multi-period distribution network problems with minimum commitment contracts pp. 531-532

Christian Clavijo López

Volume 20, issue 2, 2022

Matheuristics: using mathematics for heuristic design pp. 173-208

Marco Antonio Boschetti and Vittorio Maniezzo

Approximation issues of fractional knapsack with penalties: a note pp. 209-216

Sergey Kovalev

On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency pp. 217-239

Federica Bomboi, Christoph Buchheim and Jonas Pruente

A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service pp. 241-272

Souvik Ghosh, A. D. Banik, Joris Walraevens and Herwig Bruneel

Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost pp. 273-287

Yuan Gao, Jinjiang Yuan, C. T. Ng and T. C. E. Cheng

A multiple criteria socio-technical approach for the Portuguese Army Special Forces recruitment pp. 289-331

Ana Sara Costa, José Rui Figueira and José Borbinha

Teaching OR: automatic evaluation for linear programming modelling pp. 333-345

Hadrien Cambazard, Nicolas Catusse, Nadia Brauner and Pierre Lemaire

Transit network design: narrowing the gap between theory and practice pp. 347-348

Javier Durán-Micco

Benefits of horizontal cooperation in supply chains pp. 349-350

Thomas Hacardiaux

Volume 20, issue 1, 2022

Challenges and opportunities in crowdsourced delivery planning and operations pp. 1-21

Martin W.P Savelsbergh and Marlin W. Ulmer

An alternate approach to solve two-level hierarchical time minimization transportation problem pp. 23-61

Prabhjot Kaur, Anuj Sharma, Vanita Verma and Kalpana Dahiya

Preference elicitation for a ranking method based on multiple reference profiles pp. 63-84

Alexandru-Liviu Olteanu, Khaled Belahcene, Vincent Mousseau, Wassila Ouerdane, Antoine Rolland and Jun Zheng

A note on the integrality gap of cutting and skiving stock instances pp. 85-104

John Martinovic

Optimality and duality in nonsmooth multiobjective fractional programming problem with constraints pp. 105-137

Tran Su and Dinh Dieu Hang

A dominance-based rough set approach applied to evaluate the credit risk of sovereign bonds pp. 139-164

Julio Cezar Soares Silva, Diogo Ferreira de Lima Silva, Luciano Ferreira and Adiel Teixeira de Almeida-Filho

Controlling the emotional expressiveness of synthetic speech: a deep learning approach pp. 165-166

Noé Tits

Correction to: Exact distributional analysis of online algorithms with lookahead pp. 167-167

Fabian Dunke and Stefan Nickel

A gap in scientific reporting pp. 169-171

Gilbert Laporte and Paolo Toth

Volume 19, issue 4, 2021

A competitive optimization approach for data clustering and orthogonal non-negative matrix factorization pp. 473-499

Ja’far Dehghanpour-Sahron and Nezam Mahdavi-Amiri

Pricing and strategy selection in a closed-loop supply chain under demand and return rate uncertainty pp. 501-530

Jingfeng Dong, Shufa Sun, Guichen Gao and Ruoyi Yang

Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective pp. 531-548

Michele Conforti, Marianna Santis, Marco Summa and Francesco Rinaldi

Inductive linearization for binary quadratic programs with linear constraints pp. 549-570

Sven Mallach

Mixed integer programming formulations for the generalized traveling salesman problem with time windows pp. 571-592

Yuan Yuan, Diego Cattaruzza, Maxime Ogier, Cyriaque Rousselot and Frédéric Semet

A binary search algorithm for the general coupled task scheduling problem pp. 593-611

Mostafa Khatami and Amir Salehipour

Comparing stage-scenario with nodal formulation for multistage stochastic problems pp. 613-631

Sebastiano Vitali, Ruth Domínguez and Vittorio Moriggia

Sports timetabling: theoretical results and new insights in algorithm performance pp. 633-634

David Bulck

Dealing with uncertainty in round robin sports scheduling pp. 635-636

Xiajie Yi

Correction to: Inductive linearization for binary quadratic programs with linear constraints pp. 638-639

Sven Mallach

Volume 19, issue 3, 2021

Frank–Wolfe and friends: a journey into projection-free first-order optimization methods pp. 313-345

Immanuel M. Bomze, Francesco Rinaldi and Damiano Zeffiro

A periodic review policy for a coordinated single vendor-multiple buyers supply chain with controllable lead time and distribution-free approach pp. 347-388

Davide Castellano, Mosè Gallo and Liberatina C. Santillo

Coordination of VMI supply chain with replenishment tactic under risk aversion and sales effort pp. 389-414

Jing Liu, Fuyou Huang and Chao Ma

Improving ADMMs for solving doubly nonnegative programs through dual factorization pp. 415-448

Martina Cerulli, Marianna Santis, Elisabeth Gaar and Angelika Wiegele

Using the power of ideal solutions: simple proofs of some old and new results in location theory pp. 449-467

Frank Plastria

Simulation and optimisation of emergency department operations pp. 469-470

Lien Vanbrabant

Models and algorithms for decomposition problems pp. 471-472

Paolo Paronuzzi

Volume 19, issue 2, 2021

The trouble with the second quantifier pp. 157-181

Gerhard J. Woeginger

A comparison of penalty shootout designs in soccer pp. 183-198

László Csató

Exact distributional analysis of online algorithms with lookahead pp. 199-233

Fabian Dunke and Stefan Nickel

Coordination of a two-level supply chain with contracts pp. 235-264

Siao-Leu Phouratsamay, Safia Kedad-Sidhoum and Fanny Pascual

Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop pp. 265-288

Arianna Alfieri, Shuyu Zhou, Rosario Scatamacchia and Steef L. van de Velde

On efficient testing of capacity constraints in pickup-and-delivery problems with trailers pp. 289-307

Michael Drexl

Distributed optimization over large-scale systems for big data analytics pp. 309-310

Reza Shahbazian

Pricing-based primal and dual bounds for selected packing problems pp. 311-312

Andrea Pizzuti

Volume 19, issue 1, 2021

4OR comes of age pp. 1-13

Yves Crama, Michel Grabisch and Silvano Martello

The power of linear programming: some surprising and unexpected LPs pp. 15-40

Bruce Golden, Linus Schrage, Douglas Shier and Lida Anna Apergi

Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects pp. 41-70

Pham Thi Hoai, Hoai An Le Thi and Nguyen Canh Nam

A spectral three-term Hestenes–Stiefel conjugate gradient method pp. 71-92

Parvaneh Faramarzi and Keyvan Amini

Min-max controllable risk problems pp. 93-101

Evgeny Gurevsky, Sergey Kovalev and Mikhail Y. Kovalyov

A note: flowshop scheduling with linear deterioration and job-rejection pp. 103-111

Baruch Mor and Gur Mosheiov

Endogenous queue number determination in G/M/s systems pp. 113-126

Vasco Alves

Modified forward–backward splitting method for variational inclusions pp. 127-151

Dang Hieu, Pham Ky Anh and Le Dung Muu

Towards Explainable Knowledge-Guided Data Mining for Medical Diagnosis Aid: Application to Children Mental Disorders pp. 153-154

Sarah Itani

Models and algorithms for last mile delivery problems with multiple shipping options pp. 155-156

Yuan Yuan