| Publication | Date of Publication | Type |
|---|
The traveling salesman problem with pickup, delivery, and ride-time constraints
Networks | 2018-05-23 | Paper |
New state-space relaxations for solving the traveling salesman problem with time windows
INFORMS Journal on Computing | 2016-06-29 | Paper |
An exact algorithm for the two-echelon capacitated vehicle routing problem
Operations Research | 2013-07-02 | Paper |
Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
European Journal of Operational Research | 2012-08-16 | Paper |
An exact method for the capacitated location-routing problem
Operations Research | 2012-03-26 | Paper |
New route relaxation and pricing strategies for the vehicle routing problem
Operations Research | 2012-03-26 | Paper |
An exact algorithm for the pickup and delivery problem with time windows
Operations Research | 2011-11-18 | Paper |
An exact algorithm for the period routing problem
Operations Research | 2011-07-19 | Paper |
An exact solution framework for a broad class of vehicle routing problems
Computational Management Science | 2010-09-20 | Paper |
Algorithms for the non-bifurcated network design problem
Journal of Heuristics | 2009-08-06 | Paper |
A unified exact method for solving different classes of vehicle routing problems
Mathematical Programming. Series A. Series B | 2009-07-24 | Paper |
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
Operations Research | 2009-07-17 | Paper |
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
Operations Research | 2009-07-10 | Paper |
A dual ascent procedure for the set partitioning problem
Discrete Optimization | 2008-11-19 | Paper |
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
Mathematical Programming. Series A. Series B | 2008-10-16 | Paper |
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
Computers & Operations Research | 2006-05-16 | Paper |
An exact algorithm for the simplified multiple depot crew scheduling problem
Annals of Operations Research | 2004-11-22 | Paper |
New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
IMA Journal of Management Mathematics | 2004-09-07 | Paper |
scientific article; zbMATH DE number 2086966 (Why is no real title available?)
| 2004-08-11 | Paper |
The two-dimensional finite bin packing problem. II: New lower and upper bounds
4OR | 2004-06-11 | Paper |
The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
4OR | 2004-05-18 | Paper |
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
Networks | 2003-08-20 | Paper |
A Set Partitioning Approach to the Crew Scheduling Problem
Operations Research | 2002-11-05 | Paper |
An exact method for the vehicle routing problem with backhauls
Transportation Science | 2002-10-17 | Paper |
The Rollon-Rolloff vehicle routing problem
Transportation Science | 2002-10-17 | Paper |
An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
Management Science | 2002-10-16 | Paper |
Partitioning a matrix with non-guillotine cuts to minimize the maximum cost
Discrete Applied Mathematics | 2002-09-29 | Paper |
A new method for solving capacitated location problems based on a set partitioning approach
Computers & Operations Research | 2002-07-24 | Paper |
The project scheduling problem with irregular starting time costs
Operations Research Letters | 2000-03-19 | Paper |
A bionomic approach to the capacitated \(p\)-median problem
Journal of Heuristics | 1999-01-06 | Paper |
Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
Operations Research | 1998-08-16 | Paper |
scientific article; zbMATH DE number 915580 (Why is no real title available?)
| 1997-01-06 | Paper |
A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
Annals of Operations Research | 1996-03-18 | Paper |
Partitioning a matrix to minimize the maximum cost
Discrete Applied Mathematics | 1996-03-18 | Paper |
Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
INFOR: Information Systems and Operational Research | 1994-05-24 | Paper |
The traveling salesman problem with cumulative costs
Networks | 1993-09-05 | Paper |
scientific article; zbMATH DE number 89093 (Why is no real title available?)
| 1993-01-16 | Paper |
A heuristic procedure for the crew rostering problem
European Journal of Operational Research | 1992-10-06 | Paper |
scientific article; zbMATH DE number 4162637 (Why is no real title available?)
| 1990-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 |
Contributions to the quadratic assignment 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 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 |
