Publication:4519128
From MaRDI portal
DOI<69::AID-NET1>3.0.CO;2-Q 10.1002/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-QzbMath0972.90085MaRDI QIDQ4519128
Matteo Fischetti, Norbert Ascheuer, Martin Grötschel
Publication date: 16 November 2001
Related Items
An optimization approach for planning daily drayage operations, Solving a school bus scheduling problem with integer programming, Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP, Formulations and exact algorithms for the vehicle routing problem with time windows, Projected Chvátal-Gomory cuts for mixed integer linear programs, An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation, Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs, Projection results for vehicle routing, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
Uses Software
Cites Work
- Unnamed Item
- Order picking in an automatic warehouse: Solving online asymmetric TSPs
- Clique tree inequalities define facets of the asymmetric traveling salesman polytope
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- On the facial structure of scheduling polyhedra
- State-space relaxation procedures for the computation of bounds to routing problems
- Facets of the Asymmetric Traveling Salesman Polytope
- Special cases of traveling salesman and repairman problems with time windows
- A Computational Study of the Job-Shop Scheduling Problem
- The Fixed-Outdegree 1-Arborescence Polytope
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Two-Processor Scheduling with Start-Times and Deadlines
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
- The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
