A compact formulation of a mixed-integer set
From MaRDI portal
Recommendations
Cites work
- A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Compact formulations as a union of polyhedra
- Cutting planes in integer and mixed integer programming
- Description of 2-integer continuous knapsack polyhedra
- Disjunctive programming: Properties of the convex hull of feasible points
- On the dimension of projected polyhedra
- The Continuous Mixing Polyhedron
- The Mixing Set with Divisible Capacities
- The Mixing Set with Flows
- The mixing-MIR set with divisible capacities
Cited in
(9)- Constructive characterizations of the value function of a mixed-integer program. II
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- On the facets of mixed integer programs with two integer variables and two constraints
- Description of 2-integer continuous knapsack polyhedra
- Mixed-integer sets from two rows of two adjacent simplex bases
- On mixed-integer sets with two integer variables
- On a class of mixed-integer sets with a single integer variable
- Mixing polyhedra with two non divisible coefficients
- Compact formulations as a union of polyhedra
This page was built for publication: A compact formulation of a mixed-integer set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2786320)