Another pedagogy for mixed-integer Gomory

DOI10.1007/s13675-017-0085-3zbMath1386.90082arXiv1510.06522OpenAlexW3105997665MaRDI QIDQ1688937

Peng Zhang

Publication date: 12 January 2018

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

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

zbMATH Keywords

column generationmixed-integer programmingprimal simplex algorithmbasic mixed-integer cutGomory mixed-integer cutmixed-integer rounding cut

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (2)

Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective ⋮ Another pedagogy for pure-integer Gomory

Uses Software

• GitHub
• JLee_LinearOptimizationBook

Cites Work

• Unnamed Item
• Unnamed Item
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• The ongoing story of Gomory cuts
• Another pedagogy for pure-integer Gomory
• Integer Programming
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Integer Programming: Methods, Uses, Computations

This page was built for publication: Another pedagogy for mixed-integer Gomory