| Publication | Date of Publication | Type |
|---|
Effective metaheuristics for the latency location routing problem
International Transactions in Operational Research | 2023-10-04 | Paper |
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
International Transactions in Operational Research | 2023-09-29 | Paper |
The school bus routing problem with student choice: a bilevel approach and a simple and effective metaheuristic
International Transactions in Operational Research | 2023-09-29 | Paper |
An iterated local search algorithm for latency vehicle routing problems with multiple depots
Computers & Operations Research | 2023-07-03 | Paper |
Lagrangian matheuristics for the quadratic multiple knapsack problem
Discrete Applied Mathematics | 2023-05-15 | Paper |
A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
European Journal of Operational Research | 2021-06-07 | Paper |
Models and algorithms for the traveling salesman problem with time-dependent service times
European Journal of Operational Research | 2020-02-11 | Paper |
A heuristic algorithm for the set covering problem
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
A matheuristic for the two-stage fixed-charge transportation problem
Computers & Operations Research | 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
Computers & Operations Research | 2016-11-11 | Paper |
A new lower bound for curriculum-based course timetabling
Computers & Operations Research | 2016-11-10 | Paper |
On exact solutions for the minmax regret spanning tree problem
Computers & Operations Research | 2016-11-10 | Paper |
The generalized covering salesman problem
INFORMS Journal on Computing | 2016-06-29 | Paper |
A metaheuristic framework for nonlinear capacitated covering problems
Optimization Letters | 2016-02-23 | Paper |
Improved rolling horizon approaches to the aircraft sequencing problem
Journal of Scheduling | 2015-11-12 | Paper |
State space reduced dynamic programming for the aircraft sequencing problem with constrained position shifting
Lecture Notes in Computer Science | 2015-10-16 | Paper |
A reduced-cost iterated local search heuristic for the fixed-charge transportation problem
Operations Research | 2015-09-11 | Paper |
The recoverable robust two-level network design problem
INFORMS Journal on Computing | 2015-09-11 | Paper |
Exact approaches for solving robust prize-collecting Steiner tree problems
European Journal of Operational Research | 2015-07-28 | Paper |
Rejoinder on: ``An overview of curriculum-based course timetabling
Top | 2015-07-27 | Paper |
An overview of curriculum-based course timetabling
Top | 2015-07-27 | Paper |
On the optimal design of water distribution networks: a practical MINLP approach
Optimization and Engineering | 2014-08-20 | Paper |
Delay-robust event scheduling
Operations Research | 2014-08-11 | Paper |
A Lagrangian heuristic for a train-unit assignment problem
Discrete Applied Mathematics | 2014-04-16 | Paper |
A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems
4OR | 2014-03-24 | Paper |
On integer polytopes with few nonzero vertices
Operations Research Letters | 2013-06-24 | Paper |
Finding cliques of maximum weight on a generalization of permutation graphs
Optimization Letters | 2013-03-07 | Paper |
Nominal and robust train timetabling problems
European Journal of Operational Research | 2012-12-29 | Paper |
Models and algorithms for the train unit assignment problem
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Aircraft sequencing problems via a rolling horizon algorithm
Lecture Notes in Computer Science | 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
European Journal of Operational Research | 2012-08-16 | Paper |
A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
European Journal of Operational Research | 2012-08-16 | Paper |
Algorithms for the bin packing problem with conflicts
INFORMS Journal on Computing | 2012-07-28 | Paper |
A metaheuristic approach for the vertex coloring problem
INFORMS Journal on Computing | 2012-07-28 | Paper |
An exact approach for the vertex coloring problem
Discrete Optimization | 2012-06-20 | Paper |
A set-covering-based heuristic approach for bin-packing problems
INFORMS Journal on Computing | 2012-06-18 | Paper |
The granular tabu search and its application to the vehicle-routing problem
INFORMS Journal on Computing | 2012-05-30 | Paper |
A variable neighborhood search and its application to a ring star problem generalization
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
Management Science | 2012-02-19 | Paper |
Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
Management Science | 2012-02-12 | Paper |
A survey on vertex coloring problems
International Transactions in Operational Research | 2011-05-23 | Paper |
A heuristic procedure for the capacitated \(m\)-ring-star problem
European Journal of Operational Research | 2010-12-20 | Paper |
Comments on: Routing problems with loading constraints
Top | 2010-12-13 | Paper |
Solving a real-world train-unit assignment problem
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
An ILP improvement procedure for the open vehicle routing problem
Computers & Operations Research | 2010-09-07 | Paper |
An electromagnetism metaheuristic for the unicost set covering problem
European Journal of Operational Research | 2010-06-11 | Paper |
Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
Computers & Operations Research | 2010-06-11 | Paper |
Non-cyclic train timetabling and comparability graphs
Operations Research Letters | 2010-06-08 | Paper |
An integer linear programming local search for capacitated vehicle routing problems
Operations Research/Computer Science Interfaces | 2010-06-02 | Paper |
Exact algorithms for routing problems under vehicle capacity constraints
Annals of Operations Research | 2010-05-10 | Paper |
Models and heuristic algorithms for a weighted vertex coloring problem
Journal of Heuristics | 2009-11-20 | Paper |
An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
Operations Research | 2009-07-09 | Paper |
Modeling and Solving the Train Timetabling Problem
Operations Research | 2009-07-03 | Paper |
A column generation approach to train timetabling on a corridor
4OR | 2008-09-04 | Paper |
Recent advances in vehicle routing exact algorithms
4OR | 2008-05-20 | Paper |
An evolutionary approach for bandwidth multicoloring problems
European Journal of Operational Research | 2008-04-24 | Paper |
An MINLP Solution Method for a Water Network Problem
Lecture Notes in Computer Science | 2008-03-11 | Paper |
A Lagrangian heuristic algorithm for a real-world train timetabling problem
Discrete Applied Mathematics | 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
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
| scientific article; zbMATH DE number 2064416 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 2064407 (Why is no real title available?) | 2004-05-18 | Paper |
Models and algorithms for a staff scheduling problem
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
| scientific article; zbMATH DE number 1953192 (Why is no real title available?) | 2003-07-25 | Paper |
Lower bounds and algorithms for the 2-dimensional vector packing problem
Discrete Applied Mathematics | 2002-11-04 | Paper |
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Discrete Applied Mathematics | 2002-09-17 | Paper |
Modeling and solving the crew rostering problem
Operations Research | 2002-07-01 | Paper |
A survey of optimization models for train routing and scheduling
Transportation Science | 2002-04-17 | Paper |
A Heuristic Method for the Set Covering Problem
Operations Research | 2002-01-13 | Paper |
| scientific article; zbMATH DE number 1749221 (Why is no real title available?) | 2002-01-01 | Paper |
An exact algorithm for the subset sum problem
European Journal of Operational Research | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1749220 (Why is no real title available?) | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1749227 (Why is no real title available?) | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1683912 (Why is no real title available?) | 2001-12-18 | Paper |
Algorithms for the set covering problem
Annals of Operations Research | 2001-06-14 | Paper |
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
European Journal of Operational Research | 2000-11-23 | Paper |
A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
European Journal of Operational Research | 2000-11-08 | Paper |
New trends in exact algorithms for the \(0-1\) knapsack problem
European Journal of Operational Research | 2000-07-09 | Paper |
| scientific article; zbMATH DE number 1452992 (Why is no real title available?) | 2000-05-25 | Paper |
Algorithms and codes for dense assignment problems: The state of the art
Discrete Applied Mathematics | 2000-01-30 | Paper |
| scientific article; zbMATH DE number 1361550 (Why is no real title available?) | 1999-11-10 | Paper |
An Exact Algorithm for the Vehicle Routing Problem with Backhauls
Transportation Science | 1999-09-05 | Paper |
| scientific article; zbMATH DE number 1302173 (Why is no real title available?) | 1999-06-16 | Paper |
Exact Solution of the Quadratic Knapsack Problem
INFORMS Journal on Computing | 1999-01-01 | Paper |
On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
Annals of Operations Research | 1998-11-08 | Paper |
A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
Operations Research | 1998-09-01 | Paper |
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
Operations Research | 1998-08-10 | Paper |
A note on exact algorithms for the bottleneck generalized assignment problem
European Journal of Operational Research | 1998-06-11 | Paper |
A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
Management Science | 1998-06-08 | Paper |
Exact solution of large-scale, asymmetric traveling salesman problems
ACM Transactions on Mathematical Software | 1998-01-26 | Paper |
Algorithm 750: CDT
ACM Transactions on Mathematical Software | 1998-01-26 | Paper |
Solving the Orienteering Problem through Branch-and-Cut
INFORMS Journal on Computing | 1998-01-01 | Paper |
| scientific article; zbMATH DE number 1057930 (Why is no real title available?) | 1997-12-01 | Paper |
Heuristic Algorithms for the Handicapped Persons Transportation Problem
Transportation Science | 1997-11-25 | Paper |
| scientific article; zbMATH DE number 1054963 (Why is no real title available?) | 1997-08-28 | Paper |
Algorithms for railway crew management
Mathematical Programming. Series A. Series B | 1997-08-28 | Paper |
Exact and approximation algorithms for makespan minimization on unrelated parallel machines
Discrete Applied Mathematics | 1997-08-10 | Paper |
The symmetric generalized traveling salesman polytope
Networks | 1996-11-13 | Paper |
An exact algorithm for the capacitated shortest spanning arborescence
Annals of Operations Research | 1996-03-18 | Paper |
A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
Operations Research | 1995-01-12 | Paper |
The bottleneck generalized assignment problem
European Journal of Operational Research | 1995-01-01 | Paper |
A parallel shortest augmenting path algorithm for the assignment problem
Journal of the ACM | 1994-08-21 | Paper |
An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs
ORSA Journal on Computing | 1994-03-24 | Paper |
Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem
Management Science | 1993-09-15 | Paper |
A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
Information Processing Letters | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 44282 (Why is no real title available?) | 1993-01-23 | Paper |
An additive bounding procedure for the asymmetric travelling salesman problem
Mathematical Programming. Series A. Series B | 1992-06-28 | Paper |
Approximation Algorithms for Fixed Job Schedule Problems
Operations Research | 1992-06-28 | Paper |
An exact algorithm for large unbounded knapsack problems
Operations Research Letters | 1990-01-01 | Paper |
Lower bounds and reduction procedures for the bin packing problem
Discrete Applied Mathematics | 1990-01-01 | Paper |
New lower bounds for the symmetric travelling salesman problem
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
A branch and bound algorithm for the multiple depot vehicle scheduling problem
Networks | 1989-01-01 | Paper |
The Fixed Job Schedule Problem with Working-Time Constraints
Operations Research | 1989-01-01 | Paper |
An Additive Bounding Procedure for Combinatorial Optimization Problems
Operations Research | 1989-01-01 | Paper |
A new dominance procedure for combinatorial optimization problems
Operations Research Letters | 1988-01-01 | Paper |
A New Algorithm for the 0-1 Knapsack Problem
Management Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4125195 (Why is no real title available?) | 1988-01-01 | Paper |
Primal-dual algorithms for the assignment problem
Discrete Applied Mathematics | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3989108 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3989103 (Why is no real title available?) | 1987-01-01 | Paper |
The Fixed Job Schedule Problem with Spread-Time Constraints
Operations Research | 1987-01-01 | Paper |
Most and least uniform spanning trees
Discrete Applied Mathematics | 1986-01-01 | Paper |
A heuristic approach to the bus driver scheduling problem
European Journal of Operational Research | 1986-01-01 | Paper |
Approximation schemes for the subset-sum problem: Survey and experimental analysis
European Journal of Operational Research | 1985-01-01 | Paper |
Algorithm 632: A program for the 0–1 multiple knapsack problem
ACM Transactions on Mathematical Software | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3908167 (Why is no real title available?) | 1985-01-01 | Paper |
Worst-case analysis of greedy algorithms for the subset-sum problem
Mathematical Programming | 1984-01-01 | Paper |
A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
Management Science | 1984-01-01 | Paper |
An Algorithm for the Bottleneck Traveling Salesman Problem
Operations Research | 1984-01-01 | Paper |
Balanced optimization problems
Operations Research Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3791946 (Why is no real title available?) | 1983-01-01 | Paper |
Algorithm for the solution of the assignment problem for sparse matrices
Computing | 1983-01-01 | Paper |
Finding a minimum equivalent graph of a digraph
Networks | 1982-01-01 | Paper |
Algorithm for the solution of the bottleneck assignment problem
Computing | 1981-01-01 | Paper |
A bound and bound algorithm for the zero-one multiple knapsack problem
Discrete Applied Mathematics | 1981-01-01 | Paper |
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
Mathematical Programming | 1981-01-01 | Paper |
State-space relaxation procedures for the computation of bounds to routing problems
Networks | 1981-01-01 | Paper |
Heuristic algorithms for the multiple knapsack problem
Computing | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3743004 (Why is no real title available?) | 1981-01-01 | Paper |
Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
Management Science | 1980-01-01 | Paper |
Solution of the zero-one multiple knapsack problem
European Journal of Operational Research | 1980-01-01 | Paper |
Contributions to the quadratic assignment problem
European Journal of Operational Research | 1980-01-01 | Paper |
Optimal and canonical solutions of the change making problem
European Journal of Operational Research | 1980-01-01 | Paper |
Dynamic Loading and Unloading of Liquids into Tanks
Operations Research | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3653895 (Why is no real title available?) | 1980-01-01 | Paper |
Technical Note—A Note on the Ingargiola-Korsh Algorithm for One-Dimensional Knapsack Problems
Operations Research | 1980-01-01 | Paper |
Dynamic programming algorithms for the zero-one knapsack problem
Computing | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3637598 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3643061 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3643036 (Why is no real title available?) | 1979-01-01 | Paper |
Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
Computing | 1978-01-01 | Paper |
An upper bound for the zero-one knapsack problem and a branch and bound algorithm
European Journal of Operational Research | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3575386 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3580280 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3280598 (Why is no real title available?) | 1969-01-01 | Paper |
| scientific article; zbMATH DE number 3374211 (Why is no real title available?) | 1969-01-01 | Paper |
Operational Research: Methods and Applications
(available as arXiv preprint) | N/A | Paper |
