Pages that link to "Item:Q1580978"
From MaRDI portal
The following pages link to On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra (Q1580978):
Displaying 15 items.
- Multi-product valid inequalities for the discrete lot-sizing and scheduling problem (Q337324) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- A polyhedral study of lot-sizing with supplier selection (Q448963) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- Capacitated lot-sizing with extensions: a review (Q926571) (← links)
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times (Q954053) (← links)
- On stochastic dynamic programming for solving large-scale planning problems under uncertainty (Q1010297) (← links)
- Dynamic knapsack sets and capacitated lot-sizing (Q1411629) (← links)
- The continuous knapsack problem with capacities (Q2059181) (← links)
- A polyhedral approach to least cost influence maximization in social networks (Q2111478) (← 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)
- Single item lot sizing problems (Q2566041) (← links)
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)