A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts

DOI10.1007/978-3-642-13520-0_16zbMath1285.90017OpenAlexW1495778961MaRDI QIDQ3569926

Domenico Salvagnin, Matteo Fischetti

Publication date: 22 June 2010

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13520-0_16

zbMATH Keywords

Lagrangian relaxationmixed-integer programmingGomory's cutsrelax and cut

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (1)

On the exact separation of mixed integer knapsack cuts

Uses Software

• SCIP
• MIPLIB
• MIPLIB2003

This page was built for publication: A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts