Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order

DOI10.1007/978-3-540-85097-7_20zbMath1168.90586OpenAlexW1959100419MaRDI QIDQ5505660

Gerold Jäger, Paul Molitor

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_20

zbMATH Keywords

traveling salesman problemheuristicassignment problemexact algorithmtraveling salesman problem of second order

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (14)

Lower bounding procedure for the asymmetric quadratic traveling salesman problem ⋮ SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning ⋮ Extending single tolerances to set tolerances ⋮ The quadratic cycle cover problem: special cases and efficient bounds ⋮ The symmetric quadratic traveling salesman problem ⋮ Unnamed Item ⋮ An extended approach for lifting clique tree inequalities ⋮ Linear models and computational experiments for the quadratic TSP ⋮ A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions ⋮ A tolerance-based heuristic approach for the weighted independent set problem ⋮ Geometric and LP-based heuristics for angular travelling salesman problems in the plane ⋮ Combinatorial optimization with interaction costs: complexity and solvable cases ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem ⋮ A class of exponential neighbourhoods for the quadratic travelling salesman problem

Uses Software

• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• An efficient cost scaling algorithm for the assignment problem
• Algorithms and codes for dense assignment problems: The state of the art
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems
• A new algorithm for the assignment problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Reducibility among Combinatorial Problems
• Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
• Some Basics on Tolerances
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Construction heuristics for the asymmetric TSP.
• Evaluation of The Contract Or-Patch Heuristic Eor The Asymmetric Tsp¹

This page was built for publication: Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order