A compact formulation of a mixed-integer set

DOI10.1080/02331930802434914zbMath1202.90197OpenAlexW2062612453WikidataQ57736592 ScholiaQ57736592MaRDI QIDQ2786320

Agostinho Agra, Miguel Fragoso Constantino

Publication date: 21 September 2010

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930802434914

zbMATH Keywords

polyhedral characterization

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (1)

Mixing polyhedra with two non divisible coefficients

Cites Work

• Cutting planes in integer and mixed integer programming
• Compact formulations as a union of polyhedra
• The mixing-MIR set with divisible capacities
• On the dimension of projected polyhedra
• Disjunctive programming: Properties of the convex hull of feasible points
• A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
• Description of 2-integer continuous knapsack polyhedra
• The Mixing Set with Flows
• The Mixing Set with Divisible Capacities
• Aggregation and Mixed Integer Rounding to Solve MIPs
• The Continuous Mixing Polyhedron

This page was built for publication: A compact formulation of a mixed-integer set