Valid inequalities and separation for uncapacitated fixed charge networks
DOI10.1016/0167-6377(85)90012-4zbMATH Open0575.90045OpenAlexW1778906433MaRDI QIDQ1064271FDOQ1064271
Authors: 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
Recommendations
- Valid inequalities and separation for capacitated fixed charge flow problems
- Submodularity and valid inequalities in capacitated fixed charge networks
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems
- Erratum: ``Submodularity and valid inequalities in capacitated fixed charge networks
- The generalized fixed-charge network design problem
- New models of the generalized fixed-charge network design problem
- Node-based valid inequalities for the optimal transmission switching problem
- Revue Des Inégalités Valides Pertinentes Aux Problèmes Des Conception De Réseaux
- Solving to optimality the uncapacitated fixed-charge network flow problem
cutting planespolynomial timelocation and distribution planningsingle-item uncapacitated lot-sizing problemuncapacitated fixed charge networksvalid linear inequalitiesvariable upper bounds
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)
Cites Work
Cited In (23)
- Generalized coefficient strengthening cuts for mixed integer programming
- Erratum: ``Submodularity and valid inequalities in capacitated fixed charge networks
- Two mixed integer programming formulations arising in manufacturing management
- Fixed-charge transportation on a path: linear programming formulations
- Valid inequalities and separation for capacitated fixed charge flow problems
- Valid Linear Inequalities for Fixed Charge Problems
- A family of facets for the uncapacitated \(p\)-median polytope
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
- Valid inequalities and separation for capacitated economic lot sizing
- Using separation algorithms to generate mixed integer model reformulations
- Valid inequalities and facets of the capacitated plant location problem
- Nonconvex, lower semicontinuous piecewise linear optimization
- Uncapacitated lot sizing with backlogging: the convex hull
- A branch-and-cut algorithm for an assembly routing problem
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Submodularity and valid inequalities in capacitated fixed charge networks
- On the facets of the simple plant location packing polytope
- Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
- Strong formulations for mixed integer programming: A survey
This page was built for publication: Valid inequalities and separation for uncapacitated fixed charge networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1064271)
