Silvano Martello

Carlos Rodrigo Rey Barra

Comput. Oper. Res., 2025

2024

Operational Research: methods and applications.

[BibT_eX]

[DOI]

Christine S. M. Currie

Harilaos N. Psaraftis

J. Oper. Res. Soc., March, 2024

21 volumes for the 21st century.

[BibT_eX]

[DOI]

4OR, March, 2024

2023

Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., August, 2023

Emerging applications, models and algorithms in combinatorial optimization.

[BibT_eX]

[DOI]

Antonio Alonso-Ayuso

Discret. Appl. Math., August, 2023

2022

2DPackLib: a two-dimensional cutting and packing library.

[BibT_eX]

[DOI]

Vinícius Loti de Lima

Optim. Lett., 2022

An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2022

Knapsack problems - An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

Knapsack problems - An overview of recent advances. Part I: Single knapsack problems.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2022

Sixty-one surveys in operations research.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2022

2021

Theory and applications in combinatorial optimization.

[BibT_eX]

[DOI]

John Baptist Gauci

J. Comb. Optim., 2021

Exact solution techniques for two-dimensional cutting and packing.

[BibT_eX]

[DOI]

Vinícius Loti de Lima

Flávio Keidi Miyazawa

Eur. J. Oper. Res., 2021

The assignment and loading transportation problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2021

New progress in combinatorial optimization.

[BibT_eX]

[DOI]

Bo Chen

Bernard Ries

Discret. Appl. Math., 2021

4OR comes of age.

[BibT_eX]

[DOI]

4OR, 2021

2020

Lower and upper bounds for the non-linear generalized assignment problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2020

2019

Mathematical models and decomposition methods for the multiple knapsack problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Combinatorial Optimization: Between Practice and Theory.

[BibT_eX]

[DOI]

Andrej Brodnik

Discret. Appl. Math., 2019

2018

BPPLIB: a library for bin packing and cutting stock problems.

[BibT_eX]

[DOI]

Maxence Delorme

Optim. Lett., 2018

Computational advances in combinatorial optimization.

[BibT_eX]

[DOI]

Tibor Jordán

Tamás Kis

Discret. Appl. Math., 2018

Relaxations and heuristics for the multiple non-linear separable knapsack problem.

[BibT_eX]

[DOI]

Luca Mencarelli

Comput. Oper. Res., 2018

Exact and heuristic algorithms for the interval min-max regret generalized assignment problem.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2018

Surveys in operations research.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2018

Preface.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2018

Sweet sixteen.

[BibT_eX]

[DOI]

4OR, 2018

2017

Combinatorial optimization: theory, computation, and applications.

[BibT_eX]

[DOI]

Bo Chen

Peter Gritzmann

Discret. Appl. Math., 2017

Logic based Benders' decomposition for orthogonal stock cutting problems.

[BibT_eX]

[DOI]

Maxence Delorme

Comput. Oper. Res., 2017

Training software for orthogonal packing problems.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2017

2016

Bin packing and cutting stock problems: Mathematical models and exact algorithms.

[BibT_eX]

[DOI]

Maxence Delorme

Eur. J. Oper. Res., 2016

Heuristics for the General Multiple Non-linear Knapsack Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Twelve surveys in operations research.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2016

A brand new cheating attempt: a case of usurped identity.

[BibT_eX]

[DOI]

4OR, 2016

2015

Decision Making under Uncertainty in Electricity Markets.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2015

Heuristic and Exact Algorithms for the Interval Min-Max Regret Knapsack Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2015

Advances in Combinatorial Optimization.

[BibT_eX]

[DOI]

Bernard Ries

Discret. Appl. Math., 2015

Models and algorithms for packing rectangles into the smallest square.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

The dirty dozen of 4OR.

[BibT_eX]

[DOI]

4OR, 2015

2014

Efficient Two-Dimensional Data Allocation in IEEE 802.16 OFDMA.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2014

Graphsj 3: a Modern Didactic Application for Graph Algorithms.

[BibT_eX]

[DOI]

Gianluca Costa

J. Comput. Sci., 2014

Optimistic MILP modeling of non-linear optimization problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Algorithms for the min-max regret generalized assignment problem with interval data.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Conference on Industrial Engineering and Engineering Management, 2014

2013

Eleven surveys in operations research: III.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2013

Preface.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2013

An overview of computational issues in combinatorial optimization.

[BibT_eX]

[DOI]

Vitaly A. Strusevich

Ann. Oper. Res., 2013

2012

Complexity and approximation of an area packing problem.

[BibT_eX]

[DOI]

Optim. Lett., 2012

A note on exact and heuristic algorithms for the identical parallel machine scheduling problem.

[BibT_eX]

[DOI]

J. Heuristics, 2012

A look at the past and present of optimization - An editorial.

[BibT_eX]

[DOI]

José M. P. Paixão

Eur. J. Oper. Res., 2012

No end of the world in 2012 for 4OR.

[BibT_eX]

[DOI]

4OR, 2012

2011

Combinatorial optimization issues in scheduling.

[BibT_eX]

[DOI]

Jacek Blazewicz

Valter Boljuncic

Jadranka Skorin-Kapov

J. Sched., 2011

Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX.

[BibT_eX]

[DOI]

Manag. Sci., 2011

Heuristic algorithms for the general nonlinear separable knapsack problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2011

Developments in combinatorial optimization (ECCO-XX): Guest editorial.

[BibT_eX]

[DOI]

Hercules Vladimirou

Comput. Optim. Appl., 2011

A fast and efficient algorithm to exploit multi-user diversity in IEEE 802.16 BandAMC.

[BibT_eX]

[DOI]

Comput. Networks, 2011

2010

Piecewise linear approximation of functions of two variables in MILP models.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

An aggregate label setting policy for the multi-objective shortest path problem.

[BibT_eX]

[DOI]

Daniele Pretolani

Eur. J. Oper. Res., 2010

Jenő Egerváry: from the origins of the Hungarian algorithm to satellite communication.

[BibT_eX]

[DOI]

Albert Einstein Fernandes Muritiba

Central Eur. J. Oper. Res., 2010

Models and algorithms for fair layout optimization problems.

[BibT_eX]

[DOI]

Marcos José Negreiros Gomes

Ann. Oper. Res., 2010

Eleven surveys in operations research: II.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2010

Preface.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2010

2009

Plagiarism again: Sreenivas and Srinivas, with an update on Marcu.

[BibT_eX]

[DOI]

4OR, 2009

No 7-year itch at 4OR.

[BibT_eX]

[DOI]

4OR, 2009

Assignment Problems.

[BibT_eX]

[DOI]

Rainer E. Burkard

SIAM, ISBN: 978-0-89871-663-4, 2009

2008

Scatter Search Algorithms for Identical Parallel Machine Scheduling Problems.

[BibT_eX]

[DOI]

Proceedings of the Metaheuristics for Scheduling in Industrial and Manufacturing Applications, 2008

Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints.

[BibT_eX]

[DOI]

Networks, 2008

A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints.

[BibT_eX]

[DOI]

Networks, 2008

Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2008

Combinatorics for modern manufacturing, logistics and supply chains (ECCO XVIII).

[BibT_eX]

[DOI]

Mikhail Y. Kovalyov

Eur. J. Oper. Res., 2008

2007

Algorithm 864: General and robot-packable variants of the three-dimensional bin packing problem.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2007

Eleven surveys in Operations Research.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2007

An optimization problem in the electricity market.

[BibT_eX]

[DOI]

4OR, 2007

2006

A Tabu Search Algorithm for a Routing and Container Loading Problem.

[BibT_eX]

[DOI]

Transp. Sci., 2006

Rich models in discrete optimization: Formulation and resolution (ECCO XVI).

[BibT_eX]

[DOI]

Geir Hasle

Arne Løkketangen

Eur. J. Oper. Res., 2006

Lower bounds and heuristic algorithms for the k.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

Packing into the smallest square: Worst-case analysis of lower bounds.

[BibT_eX]

[DOI]

Discret. Optim., 2006

A case of plagiarism: Danut Marcu.

[BibT_eX]

[DOI]

4OR, 2006

4OR: Year 4.

[BibT_eX]

[DOI]

4OR, 2006

2005

Erratum to "The Three-Dimensional Bin Packing Problem": Robot-Packable and Orthogonal Variants of Packing Problems.

[BibT_eX]

[DOI]

Oper. Res., 2005

Logistics: From theory to application (ECCO XIV).

[BibT_eX]

[DOI]

Erwin Pesch

Eur. J. Oper. Res., 2005

Metaheuristics and worst-case guarantee algorithms: relations, provable properties and applications (ECCO XV).

[BibT_eX]

[DOI]

Luca Maria Gambardella

Eur. J. Oper. Res., 2005

A note on exact algorithms for the identical parallel machine scheduling problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

Acknowledgement to referees.

[BibT_eX]

[DOI]

4OR, 2005

2004

Models and Bounds for Two-Dimensional Level Packing Problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2004

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem.

[BibT_eX]

[DOI]

J. Heuristics, 2004

TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2004

Stefano Pallottino (1945-2004).

[BibT_eX]

[DOI]

4OR, 2004

2003

An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem.

[BibT_eX]

[DOI]

Oper. Res., 2003

An Exact Approach to the Strip-Packing Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2003

Upper bounds and algorithms for the maximum cardinality bin packing problem.

[BibT_eX]

[DOI]

Martine Labbé

Eur. J. Oper. Res., 2003

4OR for what purpose?

[BibT_eX]

[DOI]

4OR, 2003

2002

Graphs and Scheduling (ECCO XII).

[BibT_eX]

[DOI]

Jean François Maurras

Eur. J. Oper. Res., 2002

Heuristic algorithms for the three-dimensional bin packing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

Two-dimensional packing problems: A survey.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

Graphs and Scheduling (ECCO XIII).

[BibT_eX]

[DOI]

Gennaro Improta

Eur. J. Oper. Res., 2002

Recent advances on two-dimensional bin packing problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

A lower bound for the non-oriented two-dimensional bin packing problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems.

[BibT_eX]

[DOI]

Manag. Sci., 2001

Preface.

[BibT_eX]

[DOI]

Martine Labbé

Discret. Appl. Math., 2001

Efficient algorithms and codes for k-cardinality assignment problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

Editorial.

[BibT_eX]

[DOI]

Roberto Battiti

Alan A. Bertossi

Discret. Appl. Math., 2001

2000

The Three-Dimensional Bin Packing Problem.

[BibT_eX]

[DOI]

David Pisinger

Oper. Res., 2000

New trends in exact algorithms for the 0-1 knapsack problem.

[BibT_eX]

[DOI]

David Pisinger

Eur. J. Oper. Res., 2000

1999

Reduction of the Three-Partition Problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 1999

Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1999

Approximation algorithms for the oriented two-dimensional bin packing problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1999

Bin Packing Approximation Algorithms: Combinatorial Analysis.

[BibT_eX]

[DOI]

Edward G. Coffman Jr.

Gábor Galambos

Proceedings of the Handbook of Combinatorial Optimization, 1999

1998

On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1998

1997

Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems.

[BibT_eX]

[DOI]

Oper. Res., 1997

Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines.

[BibT_eX]

[DOI]

François Soumis

Discret. Appl. Math., 1997

The k-cardinality Assignment Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

1996

Open shop, satellite communication and a theorem by Egerváry (1931).

[BibT_eX]

[DOI]

Oper. Res. Lett., 1996

1995

An exact algorithm for the dual bin packing problem.

[BibT_eX]

[DOI]

Martine Labbé

Oper. Res. Lett., 1995

Optimal Scheduling of Tasks on Identical Parallel Processors.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1995

Minimizing the Sum of Weighted Completion Times with Unrestricted Weights.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1993

The Delivery Man Problem and Cumulative Matroids.

[BibT_eX]

[DOI]

Oper. Res., 1993

Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints.

[BibT_eX]

[DOI]

Jacek Blazewicz

Wieslaw Kubiak

Discret. Appl. Math., 1993

1992

A Note on 0.5-Bounded Greedy Algorithms for the 0/1 Knapsack Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Approximation Algorithms for Fixed Job Schedule Problems.

[BibT_eX]

[DOI]

Oper. Res., 1992

Generalized Assignment Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines.

[BibT_eX]

François Soumis

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1990

Lower bounds and reduction procedures for the bin packing problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

The selective travelling salesman problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

1989

The Fixed Job Schedule Problem with Working-Time Constraints.

[BibT_eX]

[DOI]

Oper. Res., 1989

1987

Worst-case analysis of the differencing method for the partition problem.

[BibT_eX]

[DOI]

Math. Program., 1987

The Fixed Job Schedule Problem with Spread-Time Constraints.

[BibT_eX]

[DOI]

Oper. Res., 1987

1986

Most and least uniform spanning trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

1985

Algorithm 632: A Program for the 0-1 Multiple Knapsack Problem.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1985

1984

Worst-case analysis of greedy algorithms for the subset-sum problem.

[BibT_eX]

[DOI]

Math. Program., 1984

An Algorithm for the Bottleneck Traveling Salesman Problem.

[BibT_eX]

[DOI]

Giorgio Carpaneto

Oper. Res., 1984

1983

Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1983

1982

Finding a minimum equivalent graph of a digraph.

[BibT_eX]

[DOI]

Networks, 1982

1981

A Bound and Bound algorithm for the zero-one multiple knapsack problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1981

Heuristic algorithms for the multiple knapsack problem.

[BibT_eX]

[DOI]

Computing, 1981

1980

Technical Note - A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems.

[BibT_eX]

[DOI]

Oper. Res., 1980

1979

An algorithm for finding a minimal equivalent graph of a strongly connected digraph.

[BibT_eX]

[DOI]

Computing, 1979

1978

Algorithm 37 Algorithm for the solution of the 0-1 single knapsack problem.

[BibT_eX]

[DOI]