Exact solution of large-scale, asymmetric traveling salesman problems
From MaRDI portal
Publication:4371607
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
Cited in
(39)- scientific article; zbMATH DE number 3991297 (Why is no real title available?)
- scientific article; zbMATH DE number 4029299 (Why is no real title available?)
- Tolerance-based branch and bound algorithms for the ATSP
- Special frequency quadrilaterals and an application
- A computational evaluation of online ATSP algorithms
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- 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
- scientific article; zbMATH DE number 4152160 (Why is no real title available?)
- 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 asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem
- Determination of optimal path under approach and exit constraints
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)
