An Analysis of the Asymmetric Quadratic Traveling Salesman Polytope

DOI10.1137/110858665zbMath1294.90051OpenAlexW2035877252MaRDI QIDQ4979839

Anja Fischer

Publication date: 19 June 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/110858665

zbMATH Keywords

combinatorial optimizationquadratic 0-1 programmingpolyhedral combinatoricsreload cost model

Mathematics Subject Classification ID

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

Related Items (7)

Minimization and maximization versions of the quadratic travelling salesman problem ⋮ Lower bounding procedure for the asymmetric quadratic traveling salesman problem ⋮ A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions ⋮ 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 ⋮ A Polyhedral Study of the Quadratic Traveling Salesman Problem ⋮ A class of exponential neighbourhoods for the quadratic travelling salesman problem

This page was built for publication: An Analysis of the Asymmetric Quadratic Traveling Salesman Polytope