| Publication | Date of Publication | Type |
|---|
| Effective metaheuristics for the latency location routing problem | 2023-10-04 | Paper |
| A matheuristic algorithm for the pollution and energy minimization traveling salesman problems | 2023-09-29 | Paper |
| The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic | 2023-09-29 | Paper |
| An iterated local search algorithm for latency vehicle routing problems with multiple depots | 2023-07-03 | Paper |
| Lagrangian matheuristics for the quadratic multiple knapsack problem | 2023-05-15 | Paper |
| A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems | 2022-08-30 | Paper |
| Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem | 2021-06-07 | Paper |
| Models and algorithms for the traveling salesman problem with time-dependent service times | 2020-02-11 | Paper |
| A heuristic algorithm for the set covering problem | 2019-01-11 | Paper |
| A matheuristic for the two-stage fixed-charge transportation problem | 2018-07-11 | Paper |
| Timetable optimization for high-speed trains at Chinese railways | 2017-02-14 | Paper |
| A two-phase hybrid heuristic algorithm for the capacitated location-routing problem | 2016-11-11 | Paper |
| A new lower bound for curriculum-based course timetabling | 2016-11-10 | Paper |
| On exact solutions for the minmax regret spanning tree problem | 2016-11-10 | Paper |
| The generalized covering salesman problem | 2016-06-29 | Paper |
| A metaheuristic framework for nonlinear capacitated covering problems | 2016-02-23 | Paper |
| Improved rolling horizon approaches to the aircraft sequencing problem | 2015-11-12 | Paper |
| State space reduced dynamic programming for the aircraft sequencing problem with constrained position shifting | 2015-10-16 | Paper |
| A reduced-cost iterated local search heuristic for the fixed-charge transportation problem | 2015-09-11 | Paper |
| The recoverable robust two-level network design problem | 2015-09-11 | Paper |
| Exact approaches for solving robust prize-collecting Steiner tree problems | 2015-07-28 | Paper |
| Rejoinder on: ``An overview of curriculum-based course timetabling | 2015-07-27 | Paper |
| An overview of curriculum-based course timetabling | 2015-07-27 | Paper |
| On the optimal design of water distribution networks: a practical MINLP approach | 2014-08-20 | Paper |
| Delay-robust event scheduling | 2014-08-11 | Paper |
| A Lagrangian heuristic for a train-unit assignment problem | 2014-04-16 | Paper |
| A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems | 2014-03-24 | Paper |
| On integer polytopes with few nonzero vertices | 2013-06-24 | Paper |
| Finding cliques of maximum weight on a generalization of permutation graphs | 2013-03-07 | Paper |
| Nominal and robust train timetabling problems | 2012-12-29 | Paper |
| Models and algorithms for the train unit assignment problem | 2012-11-02 | Paper |
| Aircraft sequencing problems via a rolling horizon algorithm | 2012-11-02 | Paper |
| 04. Solution of the train platforming problem | 2012-09-28 | Paper |
| Solving a real-world train unit assignment problem | 2012-09-28 | Paper |
| Robust train routing and online re-scheduling | 2012-09-28 | Paper |
| An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem | 2012-08-16 | Paper |
| A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size | 2012-08-16 | Paper |
| Algorithms for the bin packing problem with conflicts | 2012-07-28 | Paper |
| A metaheuristic approach for the vertex coloring problem | 2012-07-28 | Paper |
| An exact approach for the vertex coloring problem | 2012-06-20 | Paper |
| A set-covering-based heuristic approach for bin-packing problems | 2012-06-18 | Paper |
| The granular tabu search and its application to the vehicle-routing problem | 2012-05-30 | Paper |
| A variable neighborhood search and its application to a ring star problem generalization | 2012-05-13 | Paper |
| A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems | 2012-02-19 | Paper |
| Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem | 2012-02-12 | Paper |
| A survey on vertex coloring problems | 2011-05-23 | Paper |
| A heuristic procedure for the capacitated \(m\)-ring-star problem | 2010-12-20 | Paper |
| Comments on: Routing problems with loading constraints | 2010-12-13 | Paper |
| Solving a real-world train-unit assignment problem | 2010-09-16 | Paper |
| An ILP improvement procedure for the open vehicle routing problem | 2010-09-07 | Paper |
| An electromagnetism metaheuristic for the unicost set covering problem | 2010-06-11 | Paper |
| Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems | 2010-06-11 | Paper |
| Non-cyclic train timetabling and comparability graphs | 2010-06-08 | Paper |
| An integer linear programming local search for capacitated vehicle routing problems | 2010-06-02 | Paper |
| Exact algorithms for routing problems under vehicle capacity constraints | 2010-05-10 | Paper |
| Models and heuristic algorithms for a weighted vertex coloring problem | 2009-11-20 | Paper |
| An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem | 2009-07-09 | Paper |
| Modeling and Solving the Train Timetabling Problem | 2009-07-03 | Paper |
| A column generation approach to train timetabling on a corridor | 2008-09-04 | Paper |
| Recent advances in vehicle routing exact algorithms | 2008-05-20 | Paper |
| An evolutionary approach for bandwidth multicoloring problems | 2008-04-24 | Paper |
| An MINLP Solution Method for a Water Network Problem | 2008-03-11 | Paper |
| A Lagrangian heuristic algorithm for a real-world train timetabling problem | 2006-04-28 | Paper |
| Improving on branch-and-cut algorithms for generalized minimum spanning trees | 2006-02-08 | Paper |
| A new ILP-based refinement heuristic for vehicle routing problems | 2006-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461915 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4461906 | 2004-05-18 | Paper |
| Models and algorithms for a staff scheduling problem | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414638 | 2003-07-25 | Paper |
| Lower bounds and algorithms for the 2-dimensional vector packing problem | 2002-11-04 | Paper |
| Models, relaxations and exact approaches for the capacitated vehicle routing problem | 2002-09-17 | Paper |
| Modeling and solving the crew rostering problem | 2002-07-01 | Paper |
| A survey of optimization models for train routing and scheduling | 2002-04-17 | Paper |
| A Heuristic Method for the Set Covering Problem | 2002-01-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532224 | 2002-01-01 | Paper |
| An exact algorithm for the subset sum problem | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532223 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532230 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2759903 | 2001-12-18 | Paper |
| Algorithms for the set covering problem | 2001-06-14 | Paper |
| Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems | 2000-11-23 | Paper |
| A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls | 2000-11-08 | Paper |
| New trends in exact algorithms for the \(0-1\) knapsack problem | 2000-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955264 | 2000-05-25 | Paper |
| Algorithms and codes for dense assignment problems: The state of the art | 2000-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4699368 | 1999-11-10 | Paper |
| An Exact Algorithm for the Vehicle Routing Problem with Backhauls | 1999-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247440 | 1999-06-16 | Paper |
| Exact Solution of the Quadratic Knapsack Problem | 1999-01-01 | Paper |
| On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems | 1998-11-08 | Paper |
| A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem | 1998-09-01 | Paper |
| Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems | 1998-08-10 | Paper |
| A note on exact algorithms for the bottleneck generalized assignment problem | 1998-06-11 | Paper |
| A Polyhedral Approach to the Asymmetric Traveling Salesman Problem | 1998-06-08 | Paper |
| Exact solution of large-scale, asymmetric traveling salesman problems | 1998-01-26 | Paper |
| Algorithm 750: CDT | 1998-01-26 | Paper |
| Solving the Orienteering Problem through Branch-and-Cut | 1998-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4353005 | 1997-12-01 | Paper |
| Heuristic Algorithms for the Handicapped Persons Transportation Problem | 1997-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4350083 | 1997-08-28 | Paper |
| Algorithms for railway crew management | 1997-08-28 | Paper |
| Exact and approximation algorithms for makespan minimization on unrelated parallel machines | 1997-08-10 | Paper |
| The symmetric generalized traveling salesman polytope | 1996-11-13 | Paper |
| An exact algorithm for the capacitated shortest spanning arborescence | 1996-03-18 | Paper |
| A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs | 1995-01-12 | Paper |
| The bottleneck generalized assignment problem | 1995-01-01 | Paper |
| A parallel shortest augmenting path algorithm for the assignment problem | 1994-08-21 | Paper |
| An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs | 1994-03-24 | Paper |
| Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem | 1993-09-15 | Paper |
| A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3993418 | 1993-01-23 | Paper |
| An additive bounding procedure for the asymmetric travelling salesman problem | 1992-06-28 | Paper |
| Approximation Algorithms for Fixed Job Schedule Problems | 1992-06-28 | Paper |
| An exact algorithm for large unbounded knapsack problems | 1990-01-01 | Paper |
| Lower bounds and reduction procedures for the bin packing problem | 1990-01-01 | Paper |
| New lower bounds for the symmetric travelling salesman problem | 1989-01-01 | Paper |
| A branch and bound algorithm for the multiple depot vehicle scheduling problem | 1989-01-01 | Paper |
| The Fixed Job Schedule Problem with Working-Time Constraints | 1989-01-01 | Paper |
| An Additive Bounding Procedure for Combinatorial Optimization Problems | 1989-01-01 | Paper |
| A new dominance procedure for combinatorial optimization problems | 1988-01-01 | Paper |
| A New Algorithm for the 0-1 Knapsack Problem | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4205235 | 1988-01-01 | Paper |
| Primal-dual algorithms for the assignment problem | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751378 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3751373 | 1987-01-01 | Paper |
| The Fixed Job Schedule Problem with Spread-Time Constraints | 1987-01-01 | Paper |
| Most and least uniform spanning trees | 1986-01-01 | Paper |
| A heuristic approach to the bus driver scheduling problem | 1986-01-01 | Paper |
| Approximation schemes for the subset-sum problem: Survey and experimental analysis | 1985-01-01 | Paper |
| Algorithm 632: A program for the 0–1 multiple knapsack problem | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686500 | 1985-01-01 | Paper |
| Worst-case analysis of greedy algorithms for the subset-sum problem | 1984-01-01 | Paper |
| A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem | 1984-01-01 | Paper |
| An Algorithm for the Bottleneck Traveling Salesman Problem | 1984-01-01 | Paper |
| Balanced optimization problems | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3968762 | 1983-01-01 | Paper |
| Algorithm for the solution of the assignment problem for sparse matrices | 1983-01-01 | Paper |
| Finding a minimum equivalent graph of a digraph | 1982-01-01 | Paper |
| Algorithm for the solution of the bottleneck assignment problem | 1981-01-01 | Paper |
| A bound and bound algorithm for the zero-one multiple knapsack problem | 1981-01-01 | Paper |
| Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations | 1981-01-01 | Paper |
| State-space relaxation procedures for the computation of bounds to routing problems | 1981-01-01 | Paper |
| Heuristic algorithms for the multiple knapsack problem | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3929530 | 1981-01-01 | Paper |
| Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem | 1980-01-01 | Paper |
| Solution of the zero-one multiple knapsack problem | 1980-01-01 | Paper |
| Contributions to the quadratic assignment problem | 1980-01-01 | Paper |
| Optimal and canonical solutions of the change making problem | 1980-01-01 | Paper |
| Dynamic Loading and Unloading of Liquids into Tanks | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3853463 | 1980-01-01 | Paper |
| Technical Note—A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems | 1980-01-01 | Paper |
| Dynamic programming algorithms for the zero-one knapsack problem | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4197626 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048611 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3048582 | 1979-01-01 | Paper |
| Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem | 1978-01-01 | Paper |
| An upper bound for the zero-one knapsack problem and a branch and bound algorithm | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4145176 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4149228 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5565527 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5645772 | 1969-01-01 | Paper |
| Operational Research: Methods and Applications | N/A | Paper |
