Valid inequalities and separation for uncapacitated fixed charge networks
From MaRDI portal
Publication:1064271
DOI10.1016/0167-6377(85)90012-4zbMath0575.90045MaRDI QIDQ1064271
Laurence A. Wolsey, Tony J. van Roy
Publication date: 1985
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(85)90012-4
cutting planes; polynomial time; location and distribution planning; single-item uncapacitated lot-sizing problem; uncapacitated fixed charge networks; valid linear inequalities; variable upper bounds
90C35: Programming involving graphs or networks
90C90: Applications of mathematical programming
90C11: Mixed integer programming
90B10: Deterministic network models in operations research
90B05: Inventory, storage, reservoirs
Related Items
A family of facets for the uncapacitated \(p\)-median polytope, Nonconvex, lower semicontinuous piecewise linear optimization, Uncapacitated lot sizing with backlogging: the convex hull, Valid inequalities and separation for capacitated economic lot sizing, Lot-size models with backlogging: Strong reformulations and cutting planes, Submodularity and valid inequalities in capacitated fixed charge networks, Strong formulations for mixed integer programming: A survey, Using separation algorithms to generate mixed integer model reformulations, Two mixed integer programming formulations arising in manufacturing management, Valid inequalities and facets of the capacitated plant location problem, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems, On the facets of the simple plant location packing polytope
Cites Work
