Some Results on Node Lifting of TSP Inequalities

Robert Carr ()
Additional contact information
Robert Carr: Sandia National Labs

Journal of Combinatorial Optimization, 2000, vol. 4, issue 4, No 1, 395-414

Abstract: Abstract We can define important classes of TSP inequalities by performing Naddef and Rinaldi's node lifting operation on simple TSP inequalities. We present some new insights into the node lifting operation, namely that 1-node lifting of cut based inequalities always has a geometric interpretation if a certain claw-free condition which is satisfied by most of these TSP inequalities is met. We go on to show that node lifting of the subtour elimination inequalities does not yield any new inequalities.

Keywords: traveling salesman problem; lifting; node lifting; polytope; inequalities (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009830409833 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:4:y:2000:i:4:d:10.1023_a:1009830409833

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009830409833

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 ().