Robert Carr. Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time. In William H. Cunningham, S. Thomas McCormick, Maurice Queyranne, editors, Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings. Volume 1084 of Lecture Notes in Computer Science, pages 460-474, Springer, 1996.
@inproceedings{Carr96:0,
title = {Separating over Classes of TSP Inequalities Defined by 0 Node-Lifting in Polynominal Time},
author = {Robert Carr},
year = {1996},
researchr = {https://researchr.org/publication/Carr96%3A0},
cites = {0},
citedby = {0},
pages = {460-474},
booktitle = {Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings},
editor = {William H. Cunningham and S. Thomas McCormick and Maurice Queyranne},
volume = {1084},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-61310-2},
}