On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
From MaRDI portal
(Redirected from Publication:1580978)
Recommendations
- Dynamic knapsack sets and capacitated lot-sizing
- The application of valid inequalities to the multi-stage lot-sizing problem
- Facets and algorithms for capacitated lot sizing
- Valid inequalities and separation for capacitated economic lot sizing
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
Cites work
- A cutting plane approach to capacitated lot-sizing with start-up costs
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Dynamic version of the economic lot size model
- Facets and algorithms for capacitated lot sizing
- scientific article; zbMATH DE number 780785 (Why is no real title available?)
- Lifted flow cover inequalities for mixed 0-1 integer programs
- Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Sequence independent lifting in mixed integer programming
- The 0-1 knapsack problem with a single continuous variable
- Uncapacitated lot-sizing: The convex hull of solutions
- Valid inequalities and separation for capacitated economic lot sizing
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
Cited in
(15)- On stochastic dynamic programming for solving large-scale planning problems under uncertainty
- Dynamic knapsack sets and capacitated lot-sizing
- The continuous knapsack problem with capacities
- A polyhedral approach to least cost influence maximization in social networks
- A branch-and-cut algorithm for an assembly routing problem
- A cross entropy algorithm for the Knapsack problem with setups
- Single item lot sizing problems
- Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
- Period decompositions for the capacitated lot sizing problem with setup times
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- A polyhedral study of lot-sizing with supplier selection
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Capacitated lot-sizing with extensions: a review
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
This page was built for publication: On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1580978)
