Adam N. Letchford, Gerhard Reinelt, Dirk Oliver Theis. A Faster Exact Separation Algorithm for Blossom Inequalities. In George L. Nemhauser, Daniel Bienstock, editors, Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings. Volume 3064 of Lecture Notes in Computer Science, pages 196-205, Springer, 2004. [doi]
@inproceedings{LetchfordRT04,
title = {A Faster Exact Separation Algorithm for Blossom Inequalities},
author = {Adam N. Letchford and Gerhard Reinelt and Dirk Oliver Theis},
year = {2004},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3064&spage=196},
researchr = {https://researchr.org/publication/LetchfordRT04},
cites = {0},
citedby = {0},
pages = {196-205},
booktitle = {Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings},
editor = {George L. Nemhauser and Daniel Bienstock},
volume = {3064},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-22113-1},
}