An extended approach for lifting clique tree inequalities
Anja Fischer () and
Frank Fischer ()
Additional contact information
Anja Fischer: Chemnitz University of Technology
Frank Fischer: Chemnitz University of Technology
Journal of Combinatorial Optimization, 2015, vol. 30, issue 3, No 7, 489-519
Abstract:
Abstract We present a new lifting approach for strengthening arbitrary clique tree inequalities that are known to be facet defining for the symmetric traveling salesman problem in order to get stronger valid inequalities for the symmetric quadratic traveling salesman problem (SQTSP). Applying this new approach to the subtour elimination constraints (SEC) leads to two new classes of facet defining inequalities of SQTSP. For the special case of the SEC with two nodes we derive all known conflicting edges inequalities for SQTSP. Furthermore we extend the presented approach to the asymmetric quadratic traveling salesman problem (AQTSP).
Keywords: Traveling salesman problem; Quadratic traveling salesman problem; Polyhedral combinatorics; 90C57; 90C27 (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9647-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:3:d:10.1007_s10878-013-9647-3
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-013-9647-3
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().