4OR

2016 - 2025

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

From Springer
Bibliographic data for series maintained by Sonal Shukla (sonal.shukla@springer.com) and Springer Nature Abstracting and Indexing (indexing@springernature.com).

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 23, issue 1, 2025

A tutorial on Branch-Price-and-Cut algorithms pp. 1-52

Matteo Petris, Claudia Archetti, Diego Cattaruzza, Maxime Ogier and Frédéric Semet

An improved algorithm for solving the Weber location problem pp. 53-63

Zvi Drezner

Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems pp. 65-95

Federico Battista and Marianna Santis

Consumer preference analysis integrating online reviews: a multiple criteria group approach considering individual stochastic behavior pp. 97-122

Mei Cai and Xue Zhang

Human-aware optimization of integrated order picking decisions in warehousing logistics pp. 123-124

Thibault Prunet

Multi-neighborhood search for combinatorial optimization pp. 125-126

Roberto Maria Rosati

Scheduling and routing in dynamic semi-automated warehouses pp. 127-128

Sander Teck

Volume 22, issue 4, 2024

An optimal algorithm for variable knockout problems pp. 419-433

John Beasley

On finding the community with maximum persistence probability pp. 435-463

Alessandro Avellone, Stefano Benati, Rosanna Grassi and Giorgio Rizzini

On supply and network investment in power systems pp. 465-481

Wim Ackooij and Nadia Oudjane

A three-dimensional bin packing problem with item fragmentation and its application in the storage location assignment problem pp. 483-536

Hamid Salamati-Hormozi, Ali Husseinzadeh Kashan and Bakhtiar Ostadi

Efficient algorithms for driver scheduling with interdependent routes pp. 537-538

Carlo S. Sartori

Balancing the average weighted completion times of two classes of jobs: a new scheduling problem pp. 539-540

Matteo Avolio

Designing demand-responsive bus services for imbalanced demand pp. 541-542

Dilay Aktaş Dejaegere

Comparing with Promethee: some new theoretical contributions pp. 543-544

Gilles Dejaegere

Mathematical models and optimization algorithms for sustainable operations in manufacturing and services pp. 545-546

Giulia Caselli

Volume 22, issue 3, 2024

Preference learning and multiple criteria decision aiding: differences, commonalities, and synergies—part II pp. 313-349

Eyke Hüllermeier and Roman Słowiński

Minimization of maximum lateness on parallel machines with a single server and job release dates pp. 351-385

Abdelhak Elidrissi, Rachid Benmansour, Nicolas Zufferey, Mohammed Benbrahim and David Duvivier

Is the best–worst method path dependent? Evidence from an empirical study pp. 387-409

Jiri Mazurek, Radomír Perzina, Dominik Strzałka, Bartosz Kowal, Paweł Kuraś, Barbora Petrů Puhrová and Robert Rajs

Heuristic algorithms for the online integrated optimisation of order picking and vehicle routing decisions pp. 411-412

Ruben D’Haen

PHYLOES an evolution strategy approach phylogenetic inference based on the balanced minimum evolution criterion pp. 413-414

Andrea Gasparin

Adjustable robust optimization with nonlinear recourses pp. 415-416

Henri Lefebvre

Optimizing city logistics: analyzing the benefits of a city hub and integrated inventory routing decisions pp. 417-418

Titi Iswari

Volume 22, issue 2, 2024

Preference learning and multiple criteria decision aiding: differences, commonalities, and synergies–part I pp. 179-209

Eyke Hüllermeier and Roman Słowiński

Customer joining strategies in Markovian queues with B-limited service rule and multiple vacations pp. 211-233

Wei Sun, Xumeng Xie, Zhiyuan Zhang and Shiyong Li

A new self-scaling memoryless quasi-Newton update for unconstrained optimization pp. 235-252

M. Jourak, S. Nezhadhosein and F. Rahpeymaii

Patient referral strategy and cost sharing for a medical consortium pp. 253-281

Lijun Gao, Jun Li and Yinlian Zeng

Consensus reaching process for portfolio selection: a behavioral approach pp. 283-308

Viviana Ventre, Giacomo Tollo and Roberta Martino

Designing new metaheuristic implementations: from metaphors to automatic design pp. 309-310

Christian L. Camacho-Villalón

Optimization methods for on-demand planning of public buses pp. 311-312

Ying Lian

Volume 22, issue 1, 2024

21 volumes for the 21st century pp. 1-16

Yves Crama, Michel Grabisch and Silvano Martello

A generalization of the CIS value for cooperative cost games pp. 17-30

Dongshuang Hou, Weibin Han, Genjiu Xu and Yifan Feng

An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times pp. 31-45

Fernando Siqueira Almeida and Marcelo Seido Nagano

Inductive linearization for binary quadratic programs with linear constraints: a computational study pp. 47-87

Sven Mallach

Bridging the user equilibrium and the system optimum in static traffic assignment: a review pp. 89-119

Valentina Morandi

Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization pp. 121-144

A. L. Custódio, R. Garmanjani and M. Raydan

A tutorial on value function approximation for stochastic and dynamic transportation pp. 145-173

Arne Heinold

Towards the Goldilocks Zone of demand-responsive bus services pp. 175-176

Bryan David Galarza Montenegro

Integrated optimization and decision support systems for attended home delivery and service problems pp. 177-178

Dario Vezzali

Volume 21, issue 4, 2023

A survey of attended home delivery and service problems with a focus on applications pp. 547-583

Jean-François Cordeau, Manuel Iori and Dario Vezzali

A 2-phase approach for planning of hazardous waste collection using an unmanned aerial vehicle pp. 585-608

Jihene Kaabi, Youssef Harrath, Amine Mahjoub, Nabil Hewahi and Khadija Abdulsattar

An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem pp. 609-637

Minh Anh Nguyen, Hai Long Luong, Minh Hoàng Hà and Ha-Bang Ban

Time-locked free trial strategy in duopoly markets with switching costs pp. 639-681

Haiping Wang, Jun Lin and Lun Ran

A two-objective optimization of ship itineraries for a cruise company pp. 683-709

Gianni Di Pillo, Marcello Fabiano, Stefano Lucidi and Massimo Roma

Stakeholder involvement in decision making: the development of a mass participation tool pp. 711-712

He Huang

Contributions of Inclusion-Exclusion to exact or approximate solution of scheduling problems pp. 713-714

Olivier Ploton

Optimization methods for knapsack and tool switching problems pp. 715-716

Alberto Locatelli

Volume 21, issue 3, 2023

An introduction to variational quantum algorithms for combinatorial optimization problems pp. 363-403

Camille Grange, Michael Poss and Eric Bourreau

Integer knapsack problems with profit functions of the same value range pp. 405-419

Evgeny Gurevsky, Dmitry Kopelevich, Sergey Kovalev and Mikhail Y. Kovalyov

A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work pp. 421-437

Yunhong Min, Byung-Cheon Choi, Myoung-Ju Park and Kyung Min Kim

Critical node/edge detection problems on trees pp. 439-455

Marco Di Summa and Syed Md Omar Faruk

A note on batch scheduling on a two-machine flowshop with machine-dependent processing times pp. 457-469

Gur Mosheiov and Daniel Oron

A bilevel optimization model for the newsvendor problem with the focus theory of choice pp. 471-489

Xide Zhu, Kevin W. Li and Peijun Guo

Lexicographic optimization for the multi-container loading problem with open dimensions for a shoe manufacturer pp. 491-512

Manuel V. C. Vieira and Margarida Carvalho

Approximating the chance-constrained capacitated vehicle routing problem with robust optimization pp. 513-531

Karina Thiebaut and Artur Pessoa

Union-wise egalitarian solutions in cooperative games with a coalition structure pp. 533-545

Erfang Shan, Zhiqiang Yu and Wenrong Lyu

Volume 21, issue 2, 2023

Multiple criteria sorting models and methods. Part II: theoretical results and general issues pp. 181-204

Khaled Belahcène, Vincent Mousseau, Wassila Ouerdane, Marc Pirlot and Olivier Sobrie

A study of connectivity on dynamic graphs: computing persistent connected components pp. 205-233

Mathilde Vernet, Yoann Pigné and Éric Sanlaville

Max–max, max–min, min–max and min–min knapsack problems with a parametric constraint pp. 235-246

Nir Halman, Mikhail Y. Kovalyov and Alain Quilliot

An improved decision support model for scheduling production in an engineer-to-order manufacturer pp. 247-300

Stéphane Dauzère-Pérès and Sigrid Lise Nonås

Retailer’s optimal CSR investment in closed-loop supply chains: the impacts of supply chain structure and channel power structure pp. 301-327

Benrong Zheng, Liang Jin, Guoxuan Huang and Jie Chu

A hybrid heuristic for the rectilinear picture compression problem pp. 329-358

Ivo Koch and Javier Marenco

From vertical to horizontal structures: new optimization challenges in electricity markets pp. 359-360

Jérôme De Boeck

Air transport network optimization: analysis and selection of new markets pp. 361-362

Assia Kamal-Idrissi

Volume 21, issue 1, 2023

Multiple criteria sorting models and methods—Part I: survey of the literature pp. 1-46

Khaled Belahcène, Vincent Mousseau, Wassila Ouerdane, Marc Pirlot and Olivier Sobrie

A theoretical look at Electre Tri-nB and related sorting models pp. 1-31

Denis Bouyssou, Thierry Marchant and Marc Pirlot

A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem pp. 47-71

Caio Marinho Damião, João Marcos Pereira Silva and Eduardo Uchoa

A branch and bound approach for the tower crane selection and positioning problem with respect to mutual interference pp. 105-123

Michael Dienstknecht

A decomposition based minimax regret approach for inverse multiple criteria sorting problem pp. 125-149

Ozgur Ozpeynirci, Selin Özpeynirci and Vincent Mousseau

Constraint qualifications and optimality conditions for robust nonsmooth semi-infinite multiobjective optimization problems pp. 151-176

Nguyen Minh Tung and Mai Duy

Exploiting hypergraphs’ properties in binary polynomial optimization pp. 177-178

Silvia Di Gregorio

Empirical analysis of stochastic local search behaviour: connecting structure, components and landscape pp. 179-180

Alberto Franzin