An Algorithm for the Traveling Salesman Problem

Cited In (only showing first 100 items - show all)

Heuristically guided search and chromosome matching
Integer programming approaches to the travelling salesman problem
A survey of the operational use of ILP models
Broadening the integer programming audience, the LINDO perspective
Repulsive assignment problem
Order batching algorithms and travel-time estimation for automated storage/retrieval systems
The traveling salesman problem with backhauls
A study of complexity transitions on the asymmetric traveling salesman problem
Problem of successive megalopolis traversal with the precedence conditions
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer
Probabilistic subproblem selection in branch-and-bound algorithms
Tree based models and algorithms for the preemptive asymmetric stacker crane problem
Personnel assignment by multiobjective programming
Dynamic programming and board games: a survey
A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
A travelling salesman problem (TSP) with multiple job facilities.
Time-dependent travelling salesman problem.
Set-up saving schemes for printed circuit boards assembly
A characterization of linear admissible transformations for the m- travelling salesmen problem
An empirical study of a new metaheuristic for the traveling salesman problem
An algorithm for the traveling salesman problem with pickup and delivery customers
A diagonal completion and 2-optimal procedure for the travelling salesman problem
An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem
The traveling salesman problem: An overview of exact and approximate algorithms
Genetic algorithms applied to the solution of hybrid optimal control problems in astrodynamics
Trivial integer programs unsolvable by branch-and-bound
Auction-based approach to resolve the scheduling problem in the steel making process
Implementing vehicle routing algorithms
Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
Extremal values of global tolerances in combinatorial optimization with an additive objective function
A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
Routing order pickers in a warehouse with a middle aisle
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
A two-dimensional mapping for the traveling salesman problem
A new approach to solving the multiple traveling salesperson problem using genetic algorithms
The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
The use of state space relaxation for the dynamic facility location problem
The travelling salesman problem with precedence constraints.
Recursive branch and bound
The heuristic search under conditions of error
On the identifiability of Bayesian factor analytic models
Optimizing multi-inserts in routing problems with constraints
A discrete cross aisle design model for order-picking warehouses
The facility layout problem
Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
Branch-and-bound and parallel computation: A historical note
Dominance rules in combinatorial optimization problems
The symmetric clustered traveling salesman problem
Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations
An approach for solving a class of transportation scheduling problems
Methods of multiextremal optimization under constraints for separably quasimonotone functions
A planning and scheduling model for onsertion in printed circuit board assembly
Procedures for travelling salesman problems with additional constraints
The optimum assignments and a new heuristic approach for the traveling salesman problem
A branch and bound algorithm for the traveling purchaser problem
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
A branch and bound algorithm for minimizing the expected cost of testing coherent systems
Probabilistic analysis of solving the assignment problem for the traveling salesman problem
An exact algorithm for the clustered travelling salesman problem
An extremal constrained routing problem with internal losses
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
An improved branch and bound algorithm for minimum concave cost network flow problems
Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
Exact methods for solving the elementary shortest and longest path problems
Efficiency considerations in the implementation of parallel branch-and- bound
Optimal expansion of an existing network
A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
An efficient envelope-based branch and bound algorithm for non-convex combined heat and power production planning
Heuristics and their design: A survey
A heuristic procedure for solving the quadratic assignment problem
Multiple and bicriteria scheduling: A literature survey
SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
Choosing optimal road trajectory with random work cost in different areas
Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory
Title not available (Why is that?)
On one routing problem modeling movement in radiation fields
Avoiding spurious submovement decompositions. II: A scattershot algorithm
On one routing task with the optimization of the start-finish point
Parallel best-first branch-and-bound in discrete optimization: a framework
Towards an abstract parallel branch and bound machine
Shore hydrogen deployment problem in green ports
The seriation problem and the travelling salesman problem
Оptimization of the Start Point in the Gtsp with the Precedence Conditions
The routing bottlenecks problem (optimization within zones)
On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
A scheduling problem in the baking industry
Computational comparison on the partitioning strategies in multiple choice integer programming
ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION
Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems
A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
To the question of optimization of the starting point in the routing problem with restrictions
A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
Time-cost tradeoff in a three-dimensional assignment problem
The influence of problem specific neighborhood structures in metaheuristics performance
Optimality conditions to the acyclic travelling salesman problem.

This page was built for publication: An Algorithm for the Traveling Salesman Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5543949)