Another pedagogy for pure-integer Gomory

DOI10.1051/RO/2016013zbMATH Open1358.90077arXiv1507.05358OpenAlexW2140804988MaRDI QIDQ2969967FDOQ2969967

Authors:

Publication date: 24 March 2017

Published in: RAIRO - Operations Research (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1507.05358

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

zbMATH Keywords

cutting planesimplex algorithminteger linear programinteger programlexicographicalinteger optimizationGomory cut[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Chv%EF%BF%BD%EF%BF%BDtal-Gomory+cut&go=Go Chv��tal-Gomory cut]

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integer Programming
• Title not available (Why is that?)
• Linear-programming-based lifting and its application to primal cutting-plane algorithms
• Another pedagogy for mixed-integer Gomory

Cited In (4)

• An application of Gomory cuts in number theory
• Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
• Another pedagogy for mixed-integer Gomory
• Title not available (Why is that?)

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)