Combining and strengthening Gomory cuts

DOI10.1007/3-540-59408-6_71zbMath1500.90087OpenAlexW1815411393MaRDI QIDQ5101435

Sebastián Ceria, Cornuéjols, Gérard, Milind W. Dawande

Publication date: 30 August 2022

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59408-6_71

zbMATH Keywords

Diophantine equationsstrong cutting plane

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (2)

Chvatal--Gomory--tier cuts for general integer programs ⋮ Totally tight Chvatal-Gomory cuts

Uses Software

• MIPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Gomory cuts revisited
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• A Note on the Linear Diophantine Equation

This page was built for publication: Combining and strengthening Gomory cuts