Generating facets for finite master cyclic group polyhedra using n-step mixed integer rounding functions
DOI10.1016/J.EJOR.2010.04.021zbMATH Open1205.90199OpenAlexW2020159749WikidataQ57438410 ScholiaQ57438410MaRDI QIDQ992583FDOQ992583
Authors: Kiavash Kianfar, Yahya Fathi 
Publication date: 9 September 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.04.021
Recommendations
- Mixed integer rounding cuts and master group polyhedra
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- On a Generalization of the Master Cyclic Group Polyhedron
- On a generalization of the master cyclic group polyhedron
- A new facet generating procedure for the stable set polytope
- Facets of the \(p\)-cycle polytope
- A new face iterator for polyhedra and for more general finite locally branched lattices
- The cyclic sieving phenomenon for faces of cyclic polytopes
- Facets and rank of integer polyhedra
- Generating facets for the cut polytope of a graph by triangular elimination
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Mixed integer programming (90C11)
Cites Work
- Valid inequalities for mips and group polyhedra from approximate liftings
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Cyclic group and knapsack facets
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- Some polyhedra related to combinatorial problems
- Valid inequalities based on simple mixed-integer sets
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Two-step MIR inequalities for mixed integer programs
- Valid inequalities based on the interpolation procedure
- Sequential-Merge Facets for Two-Dimensional Group Problems
- Subadditive approaches in integer programming
Cited In (8)
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets
- Valid inequalities and facets for multi‐module survivable network design problem
- Equivariant perturbation in Gomory and Johnson's infinite group problem. I: The one-dimensional case
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- On a generalization of the master cyclic group polyhedron
- \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
This page was built for publication: Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992583)
