An Algorithm for the Traveling Salesman Problem

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

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.
The UMP exact test and the confidence interval for person parameters in IRT models
A survey of scheduling methods for multiprocessor systems
Title not available (Why is that?)
THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION
Title not available (Why is that?)
An integer programming application to solve sequencer mix problems in printed circuit board production
A mathematical model for supply chain management of blood banks in India
Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines
Probabilistic time-dependent vehicle routing problem
Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data
Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics
Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
On estimating workload in interval branch-and-bound global optimization algorithms
Deterministic global optimization in ab-initio quantum chemistry
A continuous variable representation of the traveling salesman problem
Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account
Optimal strategies in the fighting fantasy gaming system: influencing stochastic dynamics by gambling with limited resource
Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
Index Matrices as a Cost Optimization Tool of Resource Provisioning in Uncertain Cloud Computing Environment
Preventing redundant solutions in partial enumeration algorithms
On the complexity of discrete programming problems
Exact Solution of Two Location Problems via Branch-and-Bound
Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm
On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
One task of routing jobs in high radiation conditions
A 3/4 differential approximation algorithm for traveling salesman problem
Feasibility pump algorithm for sparse representation under Laplacian noise
Ein lexikographischer Suchalgorithmus zur Lösung allgemeiner ganzzahliger Programmierungsaufgaben
Solving a Routing Problem with the Aid of an Independent Computations Scheme
Two-stage dynamic programming in the routing problem with decomposition
Minimax routing problem with a system of priority tasks
On the question of the optimization of permutations in the problem with dynamic constraints
A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
The paired many-to-many pickup and delivery problem: an application
Convergence rate of a simulated annealing algorithm with noisy observations
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

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)