A polyhedral study of the quadratic traveling salesman problem

DOI10.1007/978-3-319-28697-6_21MaRDI QIDQ2806910zbMATH OpenOpenAlexFDO

Authors Anja Fischer

Publication date 19 May 2016

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28697-6_21

zbMATH Keywords

quadratic traveling salesman problemassociated polytopepath of three nodes

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• An analysis of the asymmetric quadratic traveling salesman polytope
• The symmetric quadratic traveling salesman problem
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
• Linear models and computational experiments for the quadratic TSP
• Minimization and maximization versions of the quadratic travelling salesman problem

Cites work

• An analysis of the asymmetric quadratic traveling salesman polytope
• Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
• Clique tree inequalities define facets of the asymmetric traveling salesman polytope
• On minimum reload cost paths, tours, and flows
• The Angular-Metric Traveling Salesman Problem
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• The symmetric quadratic traveling salesman problem

Cited in

(10)

• The symmetric quadratic traveling salesman problem
• Minimization and maximization versions of the quadratic travelling salesman problem
• Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
• scientific article; zbMATH DE number 16400 (Why is no real title available?)
• Quantizers ad the worst case Euclidean traveling salesman problem
• Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
• Bounded degree graphs computed for traveling salesman problem based on frequency quadrilaterals
• An analysis of the asymmetric quadratic traveling salesman polytope
• Linear models and computational experiments for the quadratic TSP
• A class of exponential neighbourhoods for the quadratic travelling salesman problem

Describes a project that uses

Uses Software

• Concorde

This page was built for publication: A polyhedral study of the quadratic traveling salesman problem

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