Combining and strengthening Gomory cuts

DOI10.1007/3-540-59408-6_71zbMATH Open1500.90087OpenAlexW1815411393MaRDI QIDQ5101435FDOQ5101435

Authors: Sebastián Ceria, Gérard Cornuéjols, Milind 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

Recommendations

• Gomory cuts revisited
• Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
• Strengthening Gomory Mixed-Integer Cuts
• Two algorithms to get strong Gomory cuts
• On the strength of Gomory mixed-integer cuts as group cuts

zbMATH Keywords

Diophantine equationsstrong cutting plane

Mathematics Subject Classification ID

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

Cites Work

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Note on the Linear Diophantine Equation

Cited In (6)

• Totally tight Chvatal-Gomory cuts
• Title not available (Why is that?)
• Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
• A computational comparison of Gomory and knapsack cuts
• Two algorithms to get strong Gomory cuts
• Chvatal--Gomory--tier cuts for general integer programs

Uses Software

• MIPLIB

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101435)