Author of the publication

Lexicography and degeneracy: can a pure cutting plane algorithm work?

, , and . Math. Program., 130 (1): 153-176 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Fast Approaches to Robust Railway Timetabling., , and . ATMOS, volume 7 of OASIcs, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)A hard integer program made easy by lexicography., , and . Math. Program., 135 (1-2): 509-514 (2012)A note on the selection of Benders' cuts., , and . Math. Program., 124 (1-2): 175-182 (2010)Eye Knowledge Network: A Social Network for the Eye Care Community., , , and . WSKS (1), volume 5288 of Lecture Notes in Computer Science, page 22-30. Springer, (2008)Fast Approaches to Improve the Robustness of a Railway Timetable., , and . Transp. Sci., 43 (3): 321-335 (2009)On the enumerative nature of Gomory's dual cutting plane method., , and . Math. Program., 125 (2): 325-351 (2010)MIP-and-refine matheuristic for smart grid energy management., , and . ITOR, 22 (1): 49-59 (2015)Can Pure Cutting Plane Algorithms Work?., , and . IPCO, volume 5035 of Lecture Notes in Computer Science, page 416-434. Springer, (2008)Lexicography and degeneracy: can a pure cutting plane algorithm work?, , and . Math. Program., 130 (1): 153-176 (2011)