An Algorithm for the Traveling Salesman Problem

Cited in

(only showing first 100 items - show all)

A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
Convergence rate of a simulated annealing algorithm with noisy observations
Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory
Heuristically guided search and chromosome matching
scientific article; zbMATH DE number 7364999 (Why is no real title available?)
A survey of the operational use of ILP models
Broadening the integer programming audience, the LINDO perspective
Repulsive assignment problem
Avoiding spurious submovement decompositions. II: A scattershot algorithm
Exact solution of two location problems via branch-and-bound
Integer programming approaches to the travelling salesman problem
On one routing problem modeling movement in radiation fields
On one routing task with the optimization of the start-finish point
The seriation problem and the travelling salesman problem
Order batching algorithms and travel-time estimation for automated storage/retrieval systems
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
Problem of successive megalopolis traversal with the precedence conditions
The traveling salesman problem with backhauls
A study of complexity transitions on the asymmetric traveling salesman problem
Some constructions for solving routing problems using decompositions and transformations of target sets
Index matrices as a cost optimization tool of resource provisioning in uncertain cloud computing environment
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
The routing bottlenecks problem (optimization within zones)
A scheduling problem in the baking industry
On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics
Probabilistic subproblem selection in branch-and-bound algorithms
Computational comparison on the partitioning strategies in multiple choice integer programming
Tree based models and algorithms for the preemptive asymmetric stacker crane problem
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
Personnel assignment by multiobjective programming
Set-up saving schemes for printed circuit boards assembly
Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems
A travelling salesman problem (TSP) with multiple job facilities.
Time-dependent travelling salesman problem.
A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
Time-cost tradeoff in a three-dimensional assignment problem
A characterization of linear admissible transformations for the m- travelling salesmen problem
Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
The influence of problem specific neighborhood structures in metaheuristics performance
To the question of optimization of the starting point in the routing problem with restrictions
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
Genetic algorithms applied to the solution of hybrid optimal control problems in astrodynamics
The traveling salesman problem: An overview of exact and approximate algorithms
Optimality conditions to the acyclic travelling salesman problem.
Trivial integer programs unsolvable by branch-and-bound
Implementing vehicle routing algorithms
Auction-based approach to resolve the scheduling problem in the steel making process
Solving a routing problem with the aid of an independent computations scheme
The UMP exact test and the confidence interval for person parameters in IRT models
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
A survey of scheduling methods for multiprocessor systems
Routing order pickers in a warehouse with a middle aisle
scientific article; zbMATH DE number 7310229 (Why is no real title available?)
THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION
scientific article; zbMATH DE number 7310206 (Why is no real title available?)
A two-dimensional mapping for the traveling salesman problem
50 years of mixed-integer nonlinear and disjunctive programming
An integer programming application to solve sequencer mix problems in printed circuit board production
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
A mathematical model for supply chain management of blood banks in India
A new approach to solving the multiple traveling salesperson problem using genetic algorithms
Optimization of the start point in the GTSP with the precedence conditions
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
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
On the identifiability of Bayesian factor analytic models
Theory and methodology of time-dependent scheduling: past, present and future
The travelling salesman problem with precedence constraints.
Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines
The heuristic search under conditions of error
A discrete cross aisle design model for order-picking warehouses
Recursive branch and bound
The facility layout problem
Optimizing multi-inserts in routing problems with constraints
Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
Branch-and-bound and parallel computation: A historical note
PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
A memory-enhanced greedy randomized adaptive search procedure for the multi-pickup and delivery problem with time windows
Dominance rules in combinatorial optimization problems
On routing problem with starting point optimization
The symmetric clustered traveling salesman problem
On estimating workload in interval branch-and-bound global optimization algorithms
Deterministic global optimization in ab-initio quantum chemistry
Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account
An efficient quantum algorithm for the traveling salesman problem
Optimal strategies in the fighting fantasy gaming system: influencing stochastic dynamics by gambling with limited resource

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)