Revival of the Gomory cuts in the 1990's

DOI10.1007/S10479-006-0100-1MaRDI QIDQ537587zbMATHOpenAlexFDO

Authors Gérard Cornuéjols

Publication date 20 May 2011

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-006-0100-1

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)

Cites work

• scientific article; zbMATH DE number 3891096 (Why is no real title available?)
• scientific article; zbMATH DE number 193499 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Gomory cuts revisited
• Integer Programming and Pricing
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework

Cited in

(8)

• A geometric approach to cut-generating functions
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
• A relax-and-cut framework for Gomory mixed-integer cuts
• Integer programming techniques for the nurse rostering problem
• Preprocessing and cutting planes with conflict graphs
• Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts
• Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
• Theoretical challenges towards cutting-plane selection

This page was built for publication: Revival of the Gomory cuts in the 1990's

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