The Continuous Mixing Polyhedron

DOI10.1287/moor.1040.0130zbMath1082.90075OpenAlexW2133341288MaRDI QIDQ5704230

Mathieu Van Vyve

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1040.0130

zbMATH Keywords

mixinglot sizingmixed integer roundingconvex hull proof

Mathematics Subject Classification ID

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

Related Items (20)

Single item lot-sizing with non-decreasing capacities ⋮ An integer programming approach for linear programs with probabilistic constraints ⋮ Stochastic lot sizing problem with nervousness considerations ⋮ Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set ⋮ On a class of mixed-integer sets with a single integer variable ⋮ \(n\)-step cycle inequalities: facets for continuous multi-mixing set and strong cuts for multi-module capacitated lot-sizing problem ⋮ On mixing sets arising in chance-constrained programming ⋮ LS-LIB: A Library of Tools for Solving Production Planning Problems ⋮ Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs ⋮ Nonunique Lifting of Integer Variables in Minimal Inequalities ⋮ Compact formulations as a union of polyhedra ⋮ The mixing-MIR set with divisible capacities ⋮ Facets for single module and multi-module capacitated lot-sizing problems without backlogging ⋮ Facets for continuous multi-mixing set with general coefficients and bounded integer variables ⋮ Extended formulations in combinatorial optimization ⋮ Extended formulations in combinatorial optimization ⋮ A compact formulation of a mixed-integer set ⋮ Valid inequalities for mixed integer linear programs ⋮ A note on the continuous mixing set ⋮ A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching

This page was built for publication: The Continuous Mixing Polyhedron