Volume 51, Number 1, January-March 2017
|Page(s)||189 - 197|
|Published online||20 January 2017|
Another pedagogy for pure-integer Gomory∗
Received: 19 July 2015
Accepted: 3 February 2016
We present pure-integer Gomory cuts in a way so that they are derived with respect to a “dual form” pure-integer optimization problem and applied on the standard-form primal side as columns, using the primal simplex algorithm. The input integer problem is not in standard form, and so the cuts are derived a bit differently. In this manner, we obtain a finitely-terminating version of pure-integer Gomory cuts that employs the primal rather than the dual simplex algorithm.
Mathematics Subject Classification: 90C10
Key words: Gomory cut / Chvátal–Gomory cut / cutting plane / integer program / integer linear program / integer optimization / simplex algorithm / lexicographical
© EDP Sciences, ROADEF, SMAI 2017
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.