Pages that link to "Item:Q1064271"
From MaRDI portal
The following pages link to Valid inequalities and separation for uncapacitated fixed charge networks (Q1064271):
Displaying 17 items.
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Nonconvex, lower semicontinuous piecewise linear optimization (Q951120) (← links)
- Uncapacitated lot sizing with backlogging: the convex hull (Q1016115) (← links)
- Valid inequalities and separation for capacitated economic lot sizing (Q1108195) (← links)
- Lot-size models with backlogging: Strong reformulations and cutting planes (Q1115342) (← links)
- Submodularity and valid inequalities in capacitated fixed charge networks (Q1121763) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- Using separation algorithms to generate mixed integer model reformulations (Q1178714) (← links)
- Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem (Q5355207) (← links)
- A family of facets for the uncapacitated \(p\)-median polytope (Q5945384) (← links)
