An Algorithm for the Traveling Salesman Problem

Cited in

(only showing first 100 items - show all)

The optimum assignments and a new heuristic approach for the traveling salesman problem
An algorithm for the traveling salesman problem with pickup and delivery customers
An upper bound for the speedup of parallel best-bound branch-and-bound algorithms
The facility layout problem
Branch-and-bound and parallel computation: A historical note
Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
Time-cost tradeoff in a three-dimensional assignment problem
Multiple and bicriteria scheduling: A literature survey
On the identifiability of Bayesian factor analytic models
Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
Heuristics and their design: A survey
A survey of scheduling methods for multiprocessor systems
A branch and bound algorithm for minimizing the expected cost of testing coherent systems
A heuristic procedure for solving the quadratic assignment problem
Probabilistic analysis of solving the assignment problem for the traveling salesman problem
Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
The traveling salesman problem: An overview of exact and approximate algorithms
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
An approach for solving a class of transportation scheduling problems
The seriation problem and the travelling salesman problem
A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer
Procedures for travelling salesman problems with additional constraints
A characterization of linear admissible transformations for the m- travelling salesmen problem
Computational comparison on the partitioning strategies in multiple choice integer programming
A branch and bound algorithm for the traveling purchaser problem
An empirical study of a new metaheuristic for the traveling salesman problem
Efficiency considerations in the implementation of parallel branch-and- bound
Set-up saving schemes for printed circuit boards assembly
A two-dimensional mapping for the traveling salesman problem
A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
The UMP exact test and the confidence interval for person parameters in IRT models
Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics
Arbitrarily tight \(\alpha \mathrm{BB}\) underestimators of general non-linear functions over sub-optimal domains
A discrete cross aisle design model for order-picking warehouses
Probabilistic time-dependent vehicle routing problem
Probabilistic prediction of the complexity of traveling salesman problems based on approximating the complexity distribution from experimental data
The heuristic search under conditions of error
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
The traveling salesman problem with backhauls
The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
An extremal constrained routing problem with internal losses
Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm
On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account
Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs
Feasibility pump algorithm for sparse representation under Laplacian noise
Research on a novel minimum-risk model for uncertain orienteering problem based on uncertainty theory
A scheduling problem in the baking industry
The influence of problem specific neighborhood structures in metaheuristics performance
The paired many-to-many pickup and delivery problem: an application
An efficient envelope-based branch and bound algorithm for non-convex combined heat and power production planning
A planning and scheduling model for onsertion in printed circuit board assembly
Avoiding spurious submovement decompositions. II: A scattershot algorithm
On estimating workload in interval branch-and-bound global optimization algorithms
Deterministic global optimization in ab-initio quantum chemistry
A new approach to solving the multiple traveling salesperson problem using genetic algorithms
Experience of multilevel parallelizing of the branch and bound method in discrete optimization problems
The travelling salesman problem with precedence constraints.
A travelling salesman problem (TSP) with multiple job facilities.
Optimality conditions to the acyclic travelling salesman problem.
Time-dependent travelling salesman problem.
Heuristically guided search and chromosome matching
Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
A mathematical model for supply chain management of blood banks in India
Optimal strategies in the fighting fantasy gaming system: influencing stochastic dynamics by gambling with limited resource
A study of complexity transitions on the asymmetric traveling salesman problem
Tree based models and algorithms for the preemptive asymmetric stacker crane problem
SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS
PARSSSE: AN ADAPTIVE PARALLEL STATE SPACE SEARCH ENGINE
Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems
A GROUPING GENETIC ALGORITHM FOR THE MULTIPLE TRAVELING SALESPERSON PROBLEM
Methods of multiextremal optimization under constraints for separably quasimonotone functions
An integer programming application to solve sequencer mix problems in printed circuit board production
Recursive branch and bound
A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
Order batching algorithms and travel-time estimation for automated storage/retrieval systems
Choosing optimal road trajectory with random work cost in different areas
Integer programming approaches to the travelling salesman problem
Personnel assignment by multiobjective programming
Implementing vehicle routing algorithms
A continuous variable representation of the traveling salesman problem
Preventing redundant solutions in partial enumeration algorithms
Dominance rules in combinatorial optimization problems
Extremal values of global tolerances in combinatorial optimization with an additive objective function
A model variant of the problem about radiation sources utilization (iterations based on optimization insertions)
Problem of successive megalopolis traversal with the precedence conditions
Solving a routing problem with the aid of an independent computations scheme
Trivial integer programs unsolvable by branch-and-bound
Optimal expansion of an existing network
On one routing problem modeling movement in radiation fields
Optimization of the start point in the GTSP with the precedence conditions
On routing problem with starting point optimization
scientific article; zbMATH DE number 7364999 (Why is no real title available?)
Index matrices as a cost optimization tool of resource provisioning in uncertain cloud computing environment
An exact algorithm for the clustered travelling salesman problem
Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm
One task of routing jobs in high radiation conditions
Optimizing multi-inserts in routing problems with constraints
On the question of the optimization of permutations in the problem with dynamic constraints

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)