Classical cuts for mixed-integer programming and branch-and-cut

DOI10.1007/S10479-005-3453-YzbMATH Open1135.90369OpenAlexW1964024778MaRDI QIDQ5896802FDOQ5896802

Authors: Manfred Padberg

Publication date: 7 March 2006

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

Full work available at URL: https://doi.org/10.1007/s10479-005-3453-y

Recommendations

Classical cuts for mixed-integer programming and branch-and-cut
scientific article; zbMATH DE number 1488891
An optimality cut for mixed integer linear programs
Cuts for Conic Mixed-Integer Programming
scientific article; zbMATH DE number 2084777
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
A cutting plane theory for mixed integer optimization
Disjunctive cuts for mixed integer nonlinear programming problems
A branch-and-cut algorithm for mixed-integer bilinear programming
On \(t\)-branch split cuts for mixed-integer programs

zbMATH Keywords

cutting planes branch-and-cut mixed-integer programming Gomory cuts

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

An Automatic Method of Solving Discrete Programming Problems
Geometric algorithms and combinatorial optimization
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
Title not available (Why is that?)
Solving Mixed Integer Programming Problems Using Automatic Reformulation
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
Gomory cuts revisited
On the symmetric travelling salesman problem I: Inequalities
Outline of an algorithm for integer solutions to linear programs
Trees and Cuts
Solving Large-Scale Zero-One Linear Programming Problems
Facets of the knapsack polytope
On the facial structure of set packing polyhedra
Intersection Cuts—A New Type of Cutting Planes for Integer Programming
On the solution of traveling salesman problems
Title not available (Why is that?)
The Boolean quadratic polytope: Some characteristics, facets and relatives
Solving Airline Crew Scheduling Problems by Branch-and-Cut
On the existence of optimal solutions to integer and mixed-integer programming problems
MIP: Theory and practice -- closing the gap
A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
Title not available (Why is that?)
Valid inequalities and facets of the capacitated plant location problem
An Introduction to the Theory of Cutting-Planes
Linear optimization and extensions.
On the Solution of Discrete Programming Problems
Odd Minimum Cut-Sets and b-Matchings
An Improved Implicit Enumeration Approach for Integer Programming
Lot-size models with backlogging: Strong reformulations and cutting planes
Valid Linear Inequalities for Fixed Charge Problems
Strong Formulations for Multi-Item Capacitated Lot Sizing
Facets and algorithms for capacitated lot sizing
Integer Programming and Pricing
Cutting planes in integer and mixed integer programming
A Cutting Plane Algorithm for the Linear Ordering Problem
A cutting plane algorithm for minimum perfect 2-matchings
Title not available (Why is that?)
Title not available (Why is that?)
On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
(1,k)-configurations and facets for packing problems
Valid inequalities and separation for capacitated economic lot sizing
Technical Note—Facets and Strong Valid Inequalities for Integer Programs
Aggregation and Mixed Integer Rounding to Solve MIPs
Computer Codes for Problems of Integer Programming
Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
Enumerative Methods in Integer Programming
Title not available (Why is that?)
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
Integer Linear Programming: A Study in Computational Efficiency
Using cutting planes to solve the symmetric Travelling Salesman problem
Technical Note—A Note on Zero-One Programming
Covering, Packing and Knapsack Problems
Cutting planes for integer programs with general integer variables
Location, scheduling, design and integer programming
\(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
Title not available (Why is that?)
Title not available (Why is that?)
A Simplified Primal (All-Integer) Integer Programming Algorithm
Minimizing Drum Latency Time
Title not available (Why is that?)
Hypercylindrically Deduced Cuts in Zero-One Integer Programs
Title not available (Why is that?)
Integer Programming Algorithms: A Framework and State-of-the-Art Survey
Strong formulations for mixed integer programming: A survey
Letter to the Editor—Computational Results of an Integer Programming Algorithm
A New Foundation for a Simplified Primal Integer Programming Algorithm
Préfermeture sur un ensemble ordonné

Cited In (14)

Optimizing a linear fractional function over the integer efficient set
Polyhedral approaches to mixed integer linear programming
Spherical cuts for integer programming problems
An optimality cut for mixed integer linear programs
Valid inequalities for mixed integer linear programs
On degenerate multi-row Gomory cuts
\(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
On \(t\)-branch split cuts for mixed-integer programs
On interval-subgradient and no-good cuts
Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II
Foundation-penalty cuts for mixed-integer programs.
Title not available (Why is that?)
Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities
Classical cuts for mixed-integer programming and branch-and-cut

Uses Software

bc-opt

This page was built for publication: Classical cuts for mixed-integer programming and branch-and-cut

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