Valid inequalities and separation for uncapacitated fixed charge networks

DOI10.1016/0167-6377(85)90012-4zbMath0575.90045OpenAlexW1778906433MaRDI QIDQ1064271

Tony J. van Roy, Laurence A. Wolsey

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

zbMATH Keywords

cutting planespolynomial timelocation and distribution planningsingle-item uncapacitated lot-sizing problemuncapacitated fixed charge networksvalid linear inequalitiesvariable upper bounds

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05)

Related Items

Lifting inequalities: a framework for generating strong cuts for nonlinear programs, 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, Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem, Using separation algorithms to generate mixed integer model reformulations, Nonconvex, lower semicontinuous piecewise linear optimization, Generalized coefficient strengthening cuts for mixed integer programming, Progress in computational mixed integer programming -- a look back from the other side of the tipping point, A family of facets for the uncapacitated \(p\)-median polytope, A branch-and-cut algorithm for an assembly routing problem, Two mixed integer programming formulations arising in manufacturing management, Valid inequalities and facets of the capacitated plant location problem, Uncapacitated lot sizing with backlogging: the convex hull, On the facets of the simple plant location packing polytope, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems

Cites Work

• Uncapacitated lot-sizing: The convex hull of solutions
• Valid Linear Inequalities for Fixed Charge Problems
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Solving Mixed Integer Programming Problems Using Automatic Reformulation
• A Selection Problem of Shared Fixed Costs and Network Flows