The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted Lagrangean approach to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>N</i>-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds for the symmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Hamiltonian Chain of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Large-scale Travelling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of linear quadratic regulators with assigned eigenstructure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel tabu search algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Wallpaper Waste, Part 1: A Class of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using simulated annealing to solve routing and location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3720323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large-scale symmetric travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4038710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search for the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of travelling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Simple Applications of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming approaches to the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using cutting planes to solve the symmetric Travelling Salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Approaches to Solving the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic for the Hamiltonian Path Problem in Euclidian Two Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic expected performance of some TSP heuristics: An empirical evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3714901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facet identification for the symmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Heuristics for Large Geometric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic exchange algorithms and Euclidean traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(92)90138-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968594877 / rank
 
Normal rank

Latest revision as of 10:39, 30 July 2024

scientific article
Language Label Description Also known as
English
The traveling salesman problem: An overview of exact and approximate algorithms
scientific article

    Statements

    The traveling salesman problem: An overview of exact and approximate algorithms (English)
    0 references
    0 references
    11 October 1992
    0 references
    survey
    0 references
    traveling salesman
    0 references
    complexity analysis
    0 references
    exact algorithms
    0 references
    heuristic algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers