Pages that link to "Item:Q1108195"
From MaRDI portal
The following pages link to Valid inequalities and separation for capacitated economic lot sizing (Q1108195):
Displayed 25 items.
- A polyhedral study of lot-sizing with supplier selection (Q448963) (← links)
- Lot sizing with minimum order quantity (Q479047) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Analysis of bounds for a capacitated single-item lot-sizing problem (Q858280) (← links)
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← links)
- Submodularity and valid inequalities in capacitated fixed charge networks (Q1121763) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- A cutting plane approach to capacitated lot-sizing with start-up costs (Q1363415) (← links)
- On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978) (← links)
- Partial objective inequalities for the multi-item capacitated lot-sizing problem (Q1652548) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (Q1824557) (← links)
- A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers (Q1886858) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- A cross entropy algorithm for the Knapsack problem with setups (Q2384601) (← links)
- Lot sizing with inventory gains (Q2467450) (← links)
- A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem (Q2583144) (← links)
- LS-LIB: A Library of Tools for Solving Production Planning Problems (Q2971615) (← links)
- Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost (Q3082694) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- Flow pack facets of the single node fixed-charge flow polytope (Q5952067) (← links)
- Supermodularity and valid inequalities for quadratic optimization with indicators (Q6165587) (← links)