Valid inequalities and separation for capacitated economic lot sizing
From MaRDI portal
Publication:1108195
DOI10.1016/0167-6377(88)90076-4zbMath0653.90051OpenAlexW2078140282MaRDI QIDQ1108195
Publication date: 1988
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(88)90076-4
Related Items
A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers, Single item lot-sizing with non-decreasing capacities, A cross entropy algorithm for the Knapsack problem with setups, Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Analysis of bounds for a capacitated single-item lot-sizing problem, Partial objective inequalities for the multi-item capacitated lot-sizing problem, A cutting plane approach to capacitated lot-sizing with start-up costs, Submodularity and valid inequalities in capacitated fixed charge networks, Strong formulations for mixed integer programming: A survey, Supermodularity and valid inequalities for quadratic optimization with indicators, LS-LIB: A Library of Tools for Solving Production Planning Problems, A polyhedral study of lot-sizing with supplier selection, Lot sizing with minimum order quantity, Classical cuts for mixed-integer programming and branch-and-cut, Lot sizing with inventory gains, A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times, Cutting planes in integer and mixed integer programming, Flow pack facets of the single node fixed-charge flow polytope, A branch-and-cut algorithm for an assembly routing problem, Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost, Facets and algorithms for capacitated lot sizing, Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds, On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra, A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem, Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
Cites Work
- Valid inequalities and separation for uncapacitated fixed charge networks
- The ellipsoid method and its consequences in combinatorial optimization
- Uncapacitated lot-sizing: The convex hull of solutions
- Valid Linear Inequalities for Fixed Charge Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- Deterministic Production Planning with Concave Costs and Capacity Constraints
