An analysis of the asymmetric quadratic traveling salesman polytope

DOI10.1137/110858665MaRDI QIDQ4979839zbMATH OpenOpenAlexFDO

Authors 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 optimizationpolyhedral combinatoricsquadratic 0-1 programmingreload cost model

Mathematics Subject Classification ID

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

Recommendations

• The symmetric quadratic traveling salesman problem
• A polyhedral study of the quadratic traveling salesman problem
• An extended approach for lifting clique tree inequalities
• Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes
• Lifted cycle inequalities for the asymmetric traveling salesman problem

Cited in

(15)

• 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
• Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
• The symmetric quadratic traveling salesman problem
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
• A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions
• Lifted cycle inequalities for the asymmetric traveling salesman problem
• A polyhedral study of the quadratic traveling salesman problem
• Lower bounding procedure for the asymmetric quadratic traveling salesman problem
• Facets of the Asymmetric Traveling Salesman Polytope
• An extended approach for lifting clique tree inequalities
• Minimization and maximization versions of the quadratic travelling salesman problem
• The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979839)