Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
From MaRDI portal
Publication:1612007
DOI10.1016/S0167-6377(02)00112-8zbMath1027.90062WikidataQ57702363 ScholiaQ57702363MaRDI QIDQ1612007
Andrea Lodi, Adam N. Letchford
Publication date: 28 August 2002
Published in: Operations Research Letters (Search for Journal in Brave)
Related Items
On the extreme inequalities of infinite group problems, Theoretical challenges towards cutting-plane selection, Mixed-integer cuts from cyclic groups, The structure of the infinite models in integer programming, Worst-case analysis of maximal dual feasible functions, A survey of dual-feasible and superadditive functions, Spherical cuts for integer programming problems, On the extremality of maximal dual feasible functions, An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable, Lexicography and degeneracy: Can a pure cutting plane algorithm work?, Constraint Integer Programming: A New Approach to Integrate CP and MIP, Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem, Generalized coefficient strengthening cuts for mixed integer programming, Equivariant perturbation in Gomory and Johnson's infinite group problem. VI: The curious case of two-sided discontinuous minimal valid functions, A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set, SCIP: solving constraint integer programs, Face dimensions of general-purpose cutting planes for mixed-integer linear programs, A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting, Valid inequalities based on simple mixed-integer sets, Light on the infinite group relaxation. I: Foundations and taxonomy
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the membership problem for the elementary closure of a polyhedron
- Strengthening cuts for mixed integer programs
- On the separation of maximally violated mod-\(k\) cuts
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Outline of an algorithm for integer solutions to linear programs
- Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Disjunctive Programming
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Elementary closures for integer programs.
