The mixing-MIR set with divisible capacities
From MaRDI portal
Publication:930344
DOI10.1007/s10107-007-0140-6zbMath1176.90433OpenAlexW2090053073MaRDI QIDQ930344
Ming Zhao, Ismael Regis jun. de Farias
Publication date: 30 June 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0140-6
Integer programming (90C10) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (12)
Single item lot-sizing with non-decreasing capacities ⋮ Covering Linear Programming with Violations ⋮ Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set ⋮ A polyhedral study on chance constrained program with random right-hand side ⋮ The Mixing Set with Divisible Capacities ⋮ On mixing sets arising in chance-constrained programming ⋮ Mixing MIR inequalities with two divisible coefficients ⋮ Mixing polyhedra with two non divisible coefficients ⋮ A compact formulation of a mixed-integer set ⋮ A note on the continuous mixing set ⋮ The mixing set with divisible capacities: a simple approach ⋮ Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
Cites Work
- Unnamed Item
- Unnamed Item
- Cutting planes in integer and mixed integer programming
- Chvátal closures for mixed integer programming problems
- Mixing MIR inequalities with two divisible coefficients
- The ellipsoid method and its consequences in combinatorial optimization
- Disjunctive programming: Properties of the convex hull of feasible points
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Strong formulations for mixed integer programs: valid inequalities and extended formulations
- On the separation of split cuts and related inequalities
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- Split closure and intersection cuts
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. (Abstract of thesis)
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Edmonds polytopes and a hierarchy of combinatorial problems
- Gomory cuts revisited
- Outline of an algorithm for integer solutions to linear programs
- Optimizing over the First Chvàtal Closure
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Disjunctive Programming
- Subset Algebra Lift Operators for 0-1 Integer Programming
- Production Planning by Mixed Integer Programming
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- The Continuous Mixing Polyhedron
- Elementary closures for integer programs.
- Mixing mixed-integer inequalities
This page was built for publication: The mixing-MIR set with divisible capacities
