Nonconvex, lower semicontinuous piecewise linear optimization
Discrete Optimization
Using separation algorithms to generate mixed integer model reformulations
Operations Research Letters
A family of facets for the uncapacitated p-median polytope
Operations Research Letters
Submodularity and valid inequalities in capacitated fixed charge networks
Operations Research Letters
Valid inequalities and separation for capacitated economic lot sizing
Operations Research Letters
| Hi-index | 0.00 |
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.