On a generalization of the master cyclic group polyhedron
From MaRDI portal
Publication:1960187
DOI10.1007/S10107-008-0252-7zbMATH Open1214.90125OpenAlexW2071841313MaRDI QIDQ1960187FDOQ1960187
Authors: Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük 
Publication date: 13 October 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-008-0252-7
Recommendations
- On a Generalization of the Master Cyclic Group Polyhedron
- The master equality polyhedron with multiple rows
- Cyclic group and knapsack facets
- Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Cyclic group and knapsack facets
- Sequence independent lifting in mixed integer programming
- Some polyhedra related to combinatorial problems
- Valid inequalities based on simple mixed-integer sets
- Facets of the Knapsack Polytope From Minimal Covers
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- How tight is the corner relaxation?
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- On the strength of Gomory mixed-integer cuts as group cuts
- Mixed-integer cuts from cyclic groups
- Valid inequalities based on the interpolation procedure
Cited In (11)
- Strengthening lattice-free cuts using non-negativity
- Vectors in a box
- Cyclic group and knapsack facets
- Constructing general dual-feasible functions
- Support vertices of the master Gomory polyhedron
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions
- Master corner polyhedron: vertices
- On a Generalization of the Master Cyclic Group Polyhedron
- The master equality polyhedron with multiple rows
- On the vertices of the master Gomory polyhedron
- Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
Uses Software
This page was built for publication: On a generalization of the master cyclic group polyhedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1960187)
