Mixing polyhedra with two non divisible coefficients
From MaRDI portal
Publication:715089
DOI10.1007/S10107-011-0448-0zbMATH Open1264.90124OpenAlexW2041296153WikidataQ57736573 ScholiaQ57736573MaRDI QIDQ715089FDOQ715089
Miguel Constantino, Agostinho Agra
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
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Production Planning by Mixed Integer Programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Mixing mixed-integer inequalities
- Title not available (Why is that?)
- Cutting planes in integer and mixed integer programming
- Network Formulations of Mixed-Integer Programs
- A compact formulation of a mixed-integer set
- Strong formulations for mixed integer programs: valid inequalities and extended formulations
- Aggregation and Mixed Integer Rounding to Solve MIPs
- The Mixing Set with Flows
- The mixing set with divisible capacities: a simple approach
- The Mixing Set with Divisible Capacities
- New Hardness Results for Diophantine Approximation
- Compact formulations as a union of polyhedra
- The mixing-MIR set with divisible capacities
- Mixing MIR inequalities with two divisible coefficients
Cited In (2)
This page was built for publication: Mixing polyhedra with two non divisible coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715089)