Revival of the Gomory cuts in the 1990's

DOI10.1007/S10479-006-0100-1zbMATH Open1213.90015OpenAlexW2069493373MaRDI QIDQ537587FDOQ537587

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

• 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
• 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?)
• Integer Programming and Pricing
• Title not available (Why is that?)

Cited In (9)

• Light on the infinite group relaxation. I: Foundations and taxonomy
• Integer programming techniques for the nurse rostering problem
• Theoretical challenges towards cutting-plane selection
• 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
• A geometric approach to cut-generating functions
• A relax-and-cut framework for Gomory mixed-integer cuts
• Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations

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)