Valid inequalities based on simple mixed-integer sets
From MaRDI portal
Publication:2583149
Recommendations
- Integer Programming and Combinatorial Optimization
- Two-step MIR inequalities for mixed integer programs
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- Mixed integer rounding cuts and master group polyhedra
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
Cites work
- k-cuts: a variation of Gomory mixed integer cuts from the LP tableau
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Corner polyhedra and their connection with cutting planes
- Cyclic group and knapsack facets
- Description of 2-integer continuous knapsack polyhedra
- Gomory cuts revisited
- MIP: Theory and practice -- closing the gap
- Non-standard approaches to integer programming
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Some polyhedra related to combinatorial problems
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- T-space and cutting planes
Cited in
(31)- Theoretical challenges towards cutting-plane selection
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging
- 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
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- Worst-case analysis of maximal dual feasible functions
- On a generalization of the master cyclic group polyhedron
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
- The master equality polyhedron with multiple rows
- Two row mixed-integer cuts via lifting
- Mixed integer rounding cuts and master group polyhedra
- Computational experiments with cross and crooked cross cuts
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
- scientific article; zbMATH DE number 1342120 (Why is no real title available?)
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
- On the extremality of maximal dual feasible functions
- Integer Programming and Combinatorial Optimization
- Valid inequalities for problems with additive variable upper bounds
- Lifting for the integer knapsack cover polyhedron
- A survey of dual-feasible and superadditive functions
- On the extreme inequalities of infinite group problems
- Mixed-integer cuts from cyclic groups
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- On the strength of Gomory mixed-integer cuts as group cuts
- 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
- Valid inequalities for mixed integer linear programs
This page was built for publication: Valid inequalities based on simple mixed-integer sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2583149)
