An extended approach for lifting clique tree inequalities

DOI10.1007/s10878-013-9647-3zbMath1354.90108OpenAlexW2001010150MaRDI QIDQ498425

Anja Fischer, Frank Fischer

Publication date: 28 September 2015

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-013-9647-3

zbMATH Keywords

traveling salesman problempolyhedral combinatoricsquadratic traveling salesman problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (4)

Minimization and maximization versions of the quadratic travelling salesman problem ⋮ A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions ⋮ Geometric and LP-based heuristics for angular travelling salesman problems in the plane ⋮ Matroid optimization problems with monotone monomials in the objective

Cites Work

• Clique tree inequalities define facets of the asymmetric traveling salesman polytope
• The symmetric quadratic traveling salesman problem
• On minimum reload cost paths, tours, and flows
• Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
• On the symmetric travelling salesman problem I: Inequalities
• On the symmetric travelling salesman problem II: Lifting theorems and facets
• Lineare Charakterisierungen von Travelling Salesman Problemen
• The Angular-Metric Traveling Salesman Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: An extended approach for lifting clique tree inequalities