2025
A risk-averse latency location-routing problem with stochastic travel times.
Eur. J. Oper. Res., 2025
The quadratic knapsack problem.
Eur. J. Oper. Res., 2025
The quadratic knapsack problem with setup.
Comput. Oper. Res., 2025
2024
Operational Research: methods and applications.
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
J. Oper. Res. Soc., March, 2024
2023
Effective metaheuristics for the latency location routing problem.
Int. Trans. Oper. Res., November, 2023
An iterated local search algorithm for latency vehicle routing problems with multiple depots.
Comput. Oper. Res., October, 2023
Lagrangian matheuristics for the Quadratic Multiple Knapsack Problem.
Discret. Appl. Math., August, 2023
The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic.
Int. Trans. Oper. Res., 2023
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems.
Int. Trans. Oper. Res., 2023
2022
A gap in scientific reporting.
4OR, 2022
2021
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem.
Eur. J. Oper. Res., 2021
Guest Editorial to the Feature Cluster "New Trends in Applied Combinatorial Optimization" (EURO/ALIO 2018).
Eur. J. Oper. Res., 2021
2020
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times.
Eur. J. Oper. Res., 2020
An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs.
Proceedings of the 39th International Conference of the Chilean Computer Science Society, 2020
2019
An Effective Peak Period Heuristic for Railway Rolling Stock Planning.
Transp. Sci., 2019
2018
Electron. Notes Discret. Math., 2018
A matheuristic for the two-stage fixed-charge transportation problem.
Comput. Oper. Res., 2018
2016
A Railway Timetable Rescheduling Approach for Handling Large-Scale Disruptions.
Transp. Sci., 2016
A metaheuristic framework for Nonlinear Capacitated Covering Problems.
Optim. Lett., 2016
Timetable Optimization for High-Speed Trains at Chinese Railways.
Electron. Notes Discret. Math., 2016
2015
Improved rolling horizon approaches to the aircraft sequencing problem.
J. Sched., 2015
The Recoverable Robust Two-Level Network Design Problem.
INFORMS J. Comput., 2015
A tutorial on non-periodic train timetabling and platforming problems.
EURO J. Transp. Logist., 2015
2014
Delay-Robust Event Scheduling.
Oper. Res., 2014
A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem.
Oper. Res., 2014
A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem.
J. Heuristics, 2014
Guest editorial to the Special Issue "Routing and Logistics" (VeRoLog 2012).
Eur. J. Oper. Res., 2014
On exact solutions for the Minmax Regret Spanning Tree problem.
Comput. Oper. Res., 2014
State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014
Classical Exact Algorithms for the Capacitated Vehicle Routing Problem.
Proceedings of the Vehicle Routing, 2014
The Family of Vehicle Routing Problems.
Proceedings of the Vehicle Routing, 2014
2013
On integer polytopes with few nonzero vertices.
Oper. Res. Lett., 2013
Finding cliques of maximum weight on a generalization of permutation graphs.
Optim. Lett., 2013
An Exact Algorithm for the Multitrip Vehicle Routing Problem.
INFORMS J. Comput., 2013
Exact approaches for solving robust prize-collecting Steiner tree problems.
Eur. J. Oper. Res., 2013
Vehicle routing: historical perspective and recent contributions.
EURO J. Transp. Logist., 2013
A Lagrangian heuristic for a train-unit assignment problem.
Discret. Appl. Math., 2013
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem.
Comput. Oper. Res., 2013
A new lower bound for curriculum-based course timetabling.
Comput. Oper. Res., 2013
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems.
4OR, 2013
2012
Railway Rolling Stock Planning: Robustness Against Large Disruptions.
Transp. Sci., 2012
The Generalized Covering Salesman Problem.
INFORMS J. Comput., 2012
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size.
Eur. J. Oper. Res., 2012
Nominal and robust train timetabling problems.
Eur. J. Oper. Res., 2012
An Integer Linear Programming based heuristic for the Capacitated m-Ring-Star Problem.
Eur. J. Oper. Res., 2012
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison.
EURO J. Transp. Logist., 2012
Aircraft Sequencing Problems via a Rolling Horizon Algorithm.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
Models and Algorithms for the Train Unit Assignment Problem.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
A Fast Heuristic Algorithm for the Train Unit Assignment Problem.
Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 2012
2011
A Freight Service Design Problem for a Railway Corridor.
Transp. Sci., 2011
Solution of the Train Platforming Problem.
Transp. Sci., 2011
A multistart heuristic for the equality generalized traveling salesman problem.
Networks, 2011
An exact approach for the Vertex Coloring Problem.
Discret. Optim., 2011
Exact solutions for the robust prize-collecting steiner tree problem.
Proceedings of the 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 2011
Infeasible path formulations for the time-dependent TSP with time windows.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011
2010
Non-cyclic train timetabling and comparability graphs.
Oper. Res. Lett., 2010
Solving a real-world train-unit assignment problem.
Math. Program., 2010
A survey on vertex coloring problems.
Int. Trans. Oper. Res., 2010
Algorithms for the Bin Packing Problem with Conflicts.
INFORMS J. Comput., 2010
An electromagnetism metaheuristic for the unicost set covering problem.
Eur. J. Oper. Res., 2010
A heuristic procedure for the Capacitated m-Ring-Star problem.
Eur. J. Oper. Res., 2010
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization.
Electron. Notes Discret. Math., 2010
An ILP improvement procedure for the Open Vehicle Routing Problem.
Comput. Oper. Res., 2010
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems.
Comput. Oper. Res., 2010
Comput. Manag. Sci., 2010
Exact algorithms for routing problems under vehicle capacity constraints.
Ann. Oper. Res., 2010
A Heuristic Algorithm for the Train-Unit Assignment Problem.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
Robust Train Routing and Online Re-scheduling.
Proceedings of the ATMOS 2010, 2010
2009
Models and heuristic algorithms for a weighted vertex coloring problem.
J. Heuristics, 2009
2008
A Metaheuristic Approach for the Vertex Coloring Problem.
INFORMS J. Comput., 2008
An evolutionary approach for bandwidth multicoloring problems.
Eur. J. Oper. Res., 2008
A column generation approach to train timetabling on a corridor.
4OR, 2008
A Multi-start Heuristic Algorithm for the Generalized Traveling Salesman Problem.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008
2007
Route 2005: Recent advances in vehicle routing optimization.
Networks, 2007
Recent advances in vehicle routing exact algorithms.
4OR, 2007
Chapter 3 Passenger Railway Optimization.
Proceedings of the Transportation, 2007
2006
A new ILP-based refinement heuristic for Vehicle Routing Problems.
Math. Program., 2006
A Set-Covering-Based Heuristic Approach for Bin-Packing Problems.
INFORMS J. Comput., 2006
A Lagrangian heuristic algorithm for a real-world train timetabling problem.
Discret. Appl. Math., 2006
An MINLP Solution Method for a Water Network Problem.
Proceedings of the Algorithms, 2006
2003
Models and algorithms for a staff scheduling problem.
Math. Program., 2003
An Exact Algorithm for the Two-Constraint 0 - 1 Knapsack Problem.
Oper. Res., 2003
The Granular Tabu Search and Its Application to the Vehicle-Routing Problem.
INFORMS J. Comput., 2003
2002
Modeling and Solving the Train Timetabling Problem.
Oper. Res., 2002
An exact algorithm for the subset sum problem.
Eur. J. Oper. Res., 2002
Models, relaxations and exact approaches for the capacitated vehicle routing problem.
Discret. Appl. Math., 2002
Proceedings of the Vehicle Routing Problem., 2002
Branch-And-Bound Algorithms for the Capacitated VRP.
Proceedings of the Vehicle Routing Problem., 2002
An Overview of Vehicle Routing Problems.
Proceedings of the Vehicle Routing Problem., 2002
2001
Abstracts for the 2000 Transportation Science Section Dissertation Prize Competition.
Transp. Sci., 2001
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems.
Manag. Sci., 2001
Lower bounds and algorithms for the 2-dimensional vector packing problem.
Discret. Appl. Math., 2001
Solution of Real-World Train Timetabling Problems.
Proceedings of the 34th Annual Hawaii International Conference on System Sciences (HICSS-34), 2001
Solving Real-World ATSP Instances by Branch-and-Cut.
Proceedings of the Combinatorial Optimization, 2001
2000
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems.
Eur. J. Oper. Res., 2000
New trends in exact algorithms for the 0-1 knapsack problem.
Eur. J. Oper. Res., 2000
Algorithms and codes for dense assignment problems: the state of the art.
Discret. Appl. Math., 2000
Algorithms for the Set Covering Problem.
Ann. Oper. Res., 2000
1999
A Heuristic Method for the Set Covering Problem.
Oper. Res., 1999
Exact Solution of the Quadratic Knapsack Problem.
INFORMS J. Comput., 1999
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls.
Eur. J. Oper. Res., 1999
1998
A Survey of Optimization Models for Train Routing and Scheduling.
Transp. Sci., 1998
Integrating Constraint Logic Programming and Operations Research Techniques for the Crew Rostering Problem.
Softw. Pract. Exp., 1998
Modeling and Solving the Crew Rostering Problem.
Oper. Res., 1998
Solving the Orienteering Problem through Branch-and-Cut.
INFORMS J. Comput., 1998
On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems.
Ann. Oper. Res., 1998
1997
An Exact Algorithm for the Vehicle Routing Problem with Backhauls.
Transp. Sci., 1997
Heuristic Algorithms for the Handicapped Persons Transportation Problem.
Transp. Sci., 1997
Algorithms for railway crew management.
Math. Program., 1997
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems.
Oper. Res., 1997
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem.
Oper. Res., 1997
Exact and Approximation Algorithms for Makespan Minimization on Unrelated Parallel Machines.
Discret. Appl. Math., 1997
1996
A Heuristic Algorithm for the Set Covering Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1996
1995
Algorithm 750: CDT: A Subroutine for the Exact Solution of Large-Scale Asymmetric Travelling Salesman Problems.
ACM Trans. Math. Softw., 1995
Exact Solution of Large Scale Asymmetric Travelling Salesman Problems.
ACM Trans. Math. Softw., 1995
The symmetric generalized traveling salesman polytope.
Networks, 1995
An exact algorithm for the capacitated shortest spanning arborescence.
Ann. Oper. Res., 1995
A Framework for Tightening 0-1 Programs Based on Extensions of Pure 0-1 KP and SS Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
1994
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs.
Oper. Res., 1994
1993
An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs.
INFORMS J. Comput., 1993
1992
An additive bounding procedure for the asymmetric travelling salesman problem.
Math. Program., 1992
A Note on 0.5-Bounded Greedy Algorithms for the 0/1 Knapsack Problem.
Inf. Process. Lett., 1992
Approximation Algorithms for Fixed Job Schedule Problems.
Oper. Res., 1992
Generalized Assignment Problems.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992
An Exact Algorithm for Makespan Minimisation on Unrelated Parallel Machines.
Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992
1991
A Parallel Shortest Augmenting Path Algorithm for the Assignment Problem.
J. ACM, 1991
1990
Lower bounds and reduction procedures for the bin packing problem.
Discret. Appl. Math., 1990
1989
A branch and bound algorithm for the multiple depot vehicle scheduling problem.
Networks, 1989
New lower bounds for the Symmetric Travelling Salesman Problem.
Math. Program., 1989
An Additive Bounding Procedure for Combinatorial Optimization Problems.
Oper. Res., 1989
The Fixed Job Schedule Problem with Working-Time Constraints.
Oper. Res., 1989
1987
The Fixed Job Schedule Problem with Spread-Time Constraints.
Oper. Res., 1987
Primal-dual algrorithms for the assignment problem.
Discret. Appl. Math., 1987
1986
Most and least uniform spanning trees.
Discret. Appl. Math., 1986
1985
Algorithm 632: A Program for the 0-1 Multiple Knapsack Problem.
ACM Trans. Math. Softw., 1985
1984
Worst-case analysis of greedy algorithms for the subset-sum problem.
Math. Program., 1984
An Algorithm for the Bottleneck Traveling Salesman Problem.
Oper. Res., 1984
1983
Algorithm for the solution of the assignment problem for sparse matrices.
Computing, 1983
1982
Finding a minimum equivalent graph of a digraph.
Networks, 1982
1981
State-space relaxation procedures for the computation of bounds to routing problems.
Networks, 1981
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations.
Math. Program., 1981
A Bound and Bound algorithm for the zero-one multiple knapsack problem.
Discret. Appl. Math., 1981
Heuristic algorithms for the multiple knapsack problem.
Computing, 1981
Algorithm for the solution of the Bottleneck Assignment Problem.
Computing, 1981
1980
Algorithm 548: Solution of the Assignment Problem [H].
ACM Trans. Math. Softw., 1980
Technical Note - A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems.
Oper. Res., 1980
Dynamic Loading and Unloading of Liquids into Tanks.
Oper. Res., 1980
Dynamic programming algorithms for the Zero-One Knapsack Problem.
Computing, 1980
1978
Algorithm 37 Algorithm for the solution of the 0-1 single knapsack problem.
Computing, 1978
1974
Operating Systems with Characteristics of Portability for Minicomputers.
Proceedings of the GI - 4. Jahrestagung, Berlin, 9.-12. Oktober 1974, 1974