A Polyhedral Study of the Quadratic Traveling Salesman Problem

DOI10.1007/978-3-319-28697-6_21zbMATH Open1347.90070OpenAlexW2494301978MaRDI QIDQ2806910FDOQ2806910

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)

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Quantizers ad the worst case Euclidean traveling salesman problem
• Bounded degree graphs computed for traveling salesman problem based on frequency quadrilaterals
• Linear models and computational experiments for the quadratic TSP
• A class of exponential neighbourhoods for the quadratic travelling salesman problem

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)