Pages that link to "Item:Q2030285"
From MaRDI portal
The following pages link to An iterative dynamic programming approach for the temporal knapsack problem (Q2030285):
Displaying 10 items.
- A PTAS for the time-invariant incremental knapsack problem (Q1661876) (← links)
- Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups (Q2080827) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities (Q2362175) (← links)
- Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation (Q5964827) (← links)
- A combinatorial flow-based formulation for temporal bin packing problems (Q6109803) (← links)
- Exact and heuristic methods for a workload allocation problem with chain precedence constraints (Q6112777) (← links)
- Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem (Q6572832) (← links)
- A heuristic-based reduction for the temporal bin packing problem with fire-ups (Q6606648) (← links)