Valid inequalities based on simple mixed-integer sets
From MaRDI portal
Publication:2583149
DOI10.1007/s10107-005-0599-yzbMath1085.90034OpenAlexW1965761939MaRDI QIDQ2583149
Publication date: 13 January 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0599-y
Related Items
Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets ⋮ On the extreme inequalities of infinite group problems ⋮ Two row mixed-integer cuts via lifting ⋮ Theoretical challenges towards cutting-plane selection ⋮ Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra ⋮ Mixed-integer cuts from cyclic groups ⋮ The structure of the infinite models in integer programming ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set ⋮ Worst-case analysis of maximal dual feasible functions ⋮ A survey of dual-feasible and superadditive functions ⋮ Lifting for the integer knapsack cover polyhedron ⋮ \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem ⋮ \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set ⋮ The master equality polyhedron with multiple rows ⋮ On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets ⋮ On the extremality of maximal dual feasible functions ⋮ On a generalization of the master cyclic group polyhedron ⋮ Facets for single module and multi-module capacitated lot-sizing problems without backlogging ⋮ On the strength of Gomory mixed-integer cuts as group cuts ⋮ Some cut-generating functions for second-order conic sets ⋮ Facets for continuous multi-mixing set with general coefficients and bounded integer variables ⋮ Equivariant perturbation in Gomory and Johnson's infinite group problem. VI: The curious case of two-sided discontinuous minimal valid functions ⋮ Mingling: mixed-integer rounding with bounds ⋮ Relations between facets of low- and high-dimensional group problems ⋮ On the complexity of cutting-plane proofs using split cuts ⋮ Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions ⋮ Light on the infinite group relaxation. I: Foundations and taxonomy
Cites Work
- Unnamed Item
- Non-standard approaches to integer programming
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Cyclic group and knapsack facets
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Description of 2-integer continuous knapsack polyhedra
- Some polyhedra related to combinatorial problems
- Gomory cuts revisited
- K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
This page was built for publication: Valid inequalities based on simple mixed-integer sets
