An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
From MaRDI portal
Publication:3753823
Recommendations
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- The traveling salesman problem. II: Exact methods
- Solution of large-scale symmetric travelling salesman problems
- Exact solution of large-scale, asymmetric traveling salesman problems
- An algorithm for solving large-scale travelling-salesman problems and its numerical implementation
Cited in
(37)- A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
- Topological design of ring networks
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- The coastal seaspace patrol sector design and allocation problem
- On the shortest path problem with negative cost cycles
- Integer linear programming formulations of multiple salesman problems and its variations
- The Adult Training Centre Problem: A Case Study
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- A heuristic circulation-network approach to solve the multi-traveling salesman problem
- A note on relatives to the Held and Karp 1-tree problem
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
- The traveling salesman problem: An overview of exact and approximate algorithms
- Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem
- New lower bounds for the symmetric travelling salesman problem
- Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies
- Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
- TSP race: minimizing completion time in time-sensitive applications
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
- A branch-and-bound approach for a vehicle routing problem with customer costs
- On the high multiplicity traveling salesman problem
- The \(m\)-Steiner traveling salesman problem with online edge blockages
- MineReduce: an approach based on data mining for problem size reduction
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations
- Graphical-structure-based models for routing problems
- Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
- Classification of travelling salesman problem formulations
- Integration of equipment planning and project scheduling
- A fast optimization method based on a hierarchical strategy for the travelling salesman problem
- Routing problems: A bibliography
- Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems
- Seeking global edges for traveling salesman problem in multi-start search
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- Algorithms for the design of network topologies with balanced disjoint rings
- The asymmetric m-travelling salesman problem: A duality based branch-and- bound algorithm
- The multiagent planning problem
- Transformation of multidepot multisalesmen problem to the standard travelling salesman problem
This page was built for publication: An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753823)
