Valid inequalities and separation for uncapacitated fixed charge networks
From MaRDI portal
(Redirected from Publication:1064271)
A family of valid linear inequalities for uncapacitated fixed charge networks is given. As special cases this family includes the linear inequalities describing the convex hull of the single-item uncapacitated lot-sizing problem and the variable upper bounds which are typically used in location and distribution planning problems. Various special cases, where the separation problem for the family of inequalities is solvable in polynomial time, are investigated.
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
Cites work
Cited in
(24)- 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
- Valid inequalities and separation for capacitated fixed charge flow problems
- A branch-and-cut algorithm for an assembly routing problem
- Erratum: ``Submodularity and valid inequalities in capacitated fixed charge networks
- Fixed-charge transportation on a path: linear programming formulations
- Valid Linear Inequalities for Fixed Charge Problems
- Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems
- Path cover and path pack inequalities for the capacitated fixed-charge network flow problem
- 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
- Revue Des Inégalités Valides Pertinentes Aux Problèmes Des Conception De Réseaux
- Generalized coefficient strengthening cuts for mixed integer programming
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Nonconvex, lower semicontinuous piecewise linear optimization
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)
