Another pedagogy for pure-integer Gomory
From MaRDI portal
Publication:2969967
Abstract: 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.
Recommendations
- Another pedagogy for mixed-integer Gomory
- An application of Gomory cuts in number theory
- On decomposition of Gödelnumberings into Friedbergnumberings
- On intuitionistic elementary arithmetic
- A numerical characterization of Gorenstein complexes
- A constructive proof of the Gohberg-Semencul formula
- scientific article; zbMATH DE number 1163420
- scientific article; zbMATH DE number 1276818
- An iterative construction of Gorenstein ideals
- Gomory integer programs
Cites work
- scientific article; zbMATH DE number 42654 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 193499 (Why is no real title available?)
- scientific article; zbMATH DE number 3209723 (Why is no real title available?)
- Another pedagogy for mixed-integer Gomory
- Integer Programming
- Linear-programming-based lifting and its application to primal cutting-plane algorithms
Cited in
(4)
This page was built for publication: Another pedagogy for pure-integer Gomory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969967)