A polyhedral study of the asymmetric traveling salesman problem with time windows
From MaRDI portal
Publication:4519128
DOI<69::AID-NET1>3.0.CO;2-Q 10.1002/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-QzbMath0972.90085OpenAlexW2127988931MaRDI QIDQ4519128
Matteo Fischetti, Martin Grötschel, Norbert Ascheuer
Publication date: 16 November 2001
Full work available at URL: https://doi.org/10.1002/1097-0037(200009)36:2<69::aid-net1>3.0.co;2-q
Related Items
Integer programming formulation and polyhedral results for windy collaborative arc routing problem, A comparison of column-generation approaches to the synchronized pickup and delivery problem, Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations, Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows, A branch-and-cut framework for the consistent traveling salesman problem, Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, Lifted and local reachability cuts for the vehicle routing problem with time windows, The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach, A branch-and-cut algorithm for the time window assignment vehicle routing problem, History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence, A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs, A branch-and-cut algorithm for the Steiner tree problem with delays, Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery, The dial-a-ride problem with private fleet and common carrier, An ILP-based local search procedure for the VRP with pickups and deliveries, The delivery man problem with time windows, Exact hybrid algorithms for solving a bi-objective vehicle routing problem, An optimization approach for planning daily drayage operations, 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, Solving a school bus scheduling problem with integer programming, The windy rural postman problem with a time-dependent zigzag option, Projected Chvátal-Gomory cuts for mixed integer linear programs, Comments on: ``Perspectives on integer programming for time-dependent models, An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation, Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks, New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times, Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading, The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach, A branch-and-cut algorithm for an assembly routing problem, Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange, Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments, A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows, New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows, Elevator dispatching problem: a mixed integer linear programming formulation and polyhedral results, Projection results for vehicle routing, Branch-and-refine for solving time-expanded MILP formulations
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
