A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
From MaRDI portal
Recommendations
Cited in
(51)- A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem
- Clique tree inequalities define facets of the asymmetric traveling salesman polytope
- A note on the complexity of the asymmetric traveling salesman problem
- The asymmetric traveling salesman problem with replenishment arcs
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints
- SelfSplit parallelization for mixed-integer linear programming
- A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs
- Cluster based branching for the asymmetric traveling salesman problem
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
- A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
- New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
- The weighted arborescence constraint
- High multiplicity asymmetric traveling salesman problem with feedback vertex set and its application to storage/retrieval system
- A personalized walking bus service requiring optimized route decisions: a real case
- Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows
- Search and delivery man problems: when are depth-first paths optimal?
- A note on the separation of subtour elimination constraints in elementary shortest path problems
- 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
- A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Determination of the candidate arc set for the asymmetric traveling salesman problem
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- Iterative patching and the asymmetric traveling salesman problem
- A branch-and-cut algorithm for multiple sequence alignment
- A column generation model for a scheduling problem with maintenance constraints
- The Uncapacitated Asymmetric Traveling Salesman Problem with Multiple Stacks
- A branch-and-cut framework for the consistent traveling salesman problem
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
- Facets of the Asymmetric Traveling Salesman Polytope
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES
- scientific article; zbMATH DE number 1342134 (Why is no real title available?)
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- scientific article; zbMATH DE number 1893558 (Why is no real title available?)
- Asymmetric multidepot vehicle routing problems: valid inequalities and a branch-and-cut algorithm
- A polynomial algorithm with approximation ratio 2/3 for the Asymmetric Maximum 2-Peripatetic Salesman Problem
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
- A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops
- A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location
- The Asymmetric Travelling Salesman Problem In Sparse Digraphs.
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
- An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
- A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints
- On the integrality gap of small asymmetric traveling salesman problems: a polyhedral and computational approach
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- Solving the asymmetric traveling purchaser problem
- Combined route capacity and route length models for unit demand vehicle routing problems
This page was built for publication: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4392516)
