Exact solution of large-scale, asymmetric traveling salesman problems
DOI10.1145/212066.212081zbMATH Open0887.65058DBLPjournals/toms/CarpanetoDT95OpenAlexW1986985656WikidataQ59222314 ScholiaQ59222314MaRDI QIDQ4371607FDOQ4371607
Authors: Giorgio Carpaneto, Mauro Dell'Amico, Paolo Toth 
Publication date: 26 January 1998
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1995-21/
Recommendations
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
- Solution of large-scale symmetric travelling salesman problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Algorithm 750: CDT
branch-and-bound algorithmassignment problemreductionasymmetric traveling salesman problemelimination branching schemeno wait flow shop problemsstacker crane problems
Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Cited In (39)
- Tolerance-based branch and bound algorithms for the ATSP
- Special frequency quadrilaterals and an application
- A computational evaluation of online ATSP algorithms
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Combining GLSP and ATSP approaches to lot sizing and sequencing in the production of animal feed supplements
- Improved filtering for weighted circuit constraints
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- A review of TSP based approaches for flowshop scheduling
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- Designing the master schedule for demand-adaptive transit systems
- A threshold constraint based depth-first-search branch-bound algorithm for solving asymmetric traveling salesman problems
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
- Exact models for the flying sidekick traveling salesman problem
- Title not available (Why is that?)
- Iterative patching and the asymmetric traveling salesman problem
- A data-guided lexisearch algorithm for the asymmetric traveling salesman problem
- A learning based algorithm for drone routing
- An exact method for scheduling a yard crane
- A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching
- On the stochastic complexity of the asymmetric traveling salesman problem
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
- Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- Lower tolerance-based branch and bound algorithms for the ATSP
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem
- Towards backbone computing: a greedy-whitening based approach
- Algorithms and codes for dense assignment problems: The state of the art
- SELECTION OF RELAXATION PROBLEMS FOR A CLASS OF ASYMMETRIC TRAVELING SALESMAN PROBLEM INSTANCES
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- Determination of optimal path under approach and exit constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Exact solution of large-scale, asymmetric traveling salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371607)
