In Pursuit of the Traveling Salesman
From MaRDI portal
Publication:5894461
DOI10.1515/9781400839599zbMath1236.00007OpenAlexW4253602158MaRDI QIDQ5894461
Publication date: 17 January 2012
Full work available at URL: https://doi.org/10.1515/9781400839599
Abstract computational complexity for mathematical programming problems (90C60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Popularization of mathematics (00A09)
Related Items (43)
On sequential traversal of sets ⋮ Mathematical formulations for a 1-full-truckload pickup-and-delivery problem ⋮ One task of routing jobs in high radiation conditions ⋮ Evolutionary operators for the Hamiltonian completion problem ⋮ Adapting the traveling salesman problem to an adiabatic quantum computer ⋮ A model variant of the problem about radiation sources utilization (iterations based on optimization insertions) ⋮ A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem ⋮ Dynamic programming in the routing problem: decomposition variant ⋮ A note on computational aspects of the Steiner traveling salesman problem ⋮ Two-stage dynamic programming in the routing problem with decomposition ⋮ Minimax routing problem with a system of priority tasks ⋮ On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics ⋮ Exploring Endless Space ⋮ A bottleneck routing problem with a system of priority tasks ⋮ Optimizing multi-inserts in routing problems with constraints ⋮ On the question of the optimization of permutations in the problem with dynamic constraints ⋮ Network Reconstruction – A New Approach to the Traveling Salesman Problem and Complexity ⋮ OPTIMIZING THE STARTING POINT IN A PRECEDENCE CONSTRAINED ROUTING PROBLEM WITH COMPLICATED TRAVEL COST FUNCTIONS ⋮ A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs ⋮ Priority functions for the approximation of the metric TSP ⋮ On one routing task with the optimization of the start-finish point ⋮ The routing problems with optimization of the starting point: dynamic programming ⋮ Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs ⋮ To the question of optimization of the starting point in the routing problem with restrictions ⋮ Travelling salesman problem in tissue P systems with costs ⋮ A linearithmic heuristic for the travelling salesman problem ⋮ Routing under constraints: problem of visit to megalopolises ⋮ POPMUSIC for the travelling salesman problem ⋮ Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs ⋮ A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions ⋮ The windy rural postman problem with a time-dependent zigzag option ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ A Davidson college multi-objective assignment problem: a case study ⋮ A discrete-continuous routing problem with precedence constraints ⋮ Solving a Routing Problem with the Aid of an Independent Computations Scheme ⋮ On one routing problem modeling movement in radiation fields ⋮ Оptimization of the Start Point in the Gtsp with the Precedence Conditions ⋮ Dynamic programming in the generalized bottleneck problem and the start point optimization ⋮ ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION ⋮ On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks ⋮ A class of exponential neighbourhoods for the quadratic travelling salesman problem ⋮ New Bounds for the Traveling Salesman Constant ⋮ Solving the traveling delivery person problem with limited computational time
This page was built for publication: In Pursuit of the Traveling Salesman
