Mixing polyhedra with two non divisible coefficients

DOI10.1007/s10107-011-0448-0zbMath1264.90124WikidataQ57736573 ScholiaQ57736573MaRDI QIDQ715089

Agostinho Agra, Miguel Fragoso Constantino

Publication date: 15 October 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-011-0448-0

zbMATH Keywords

mixed integer programming; facet defining inequality

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

Cites Work

• Unnamed Item
• Unnamed Item
• Cutting planes in integer and mixed integer programming
• Compact formulations as a union of polyhedra
• The mixing-MIR set with divisible capacities
• Mixing MIR inequalities with two divisible coefficients
• The mixing set with divisible capacities: a simple approach
• Disjunctive programming: Properties of the convex hull of feasible points
• Strong formulations for mixed integer programs: valid inequalities and extended formulations
• A compact formulation of a mixed-integer set
• Network Formulations of Mixed-Integer Programs
• The Mixing Set with Flows
• The Mixing Set with Divisible Capacities
• Aggregation and Mixed Integer Rounding to Solve MIPs
• New Hardness Results for Diophantine Approximation
• Production Planning by Mixed Integer Programming
• Mixing mixed-integer inequalities