Pages that link to "Item:Q2147011"
From MaRDI portal
The following pages link to Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011):
Displaying 15 items.
- Learning-based multi-objective evolutionary algorithm for batching decision problem (Q2108120) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Distributed asynchronous column generation (Q2676290) (← links)
- Generalization of the subset sum problem and cubic forms (Q6039136) (← links)
- Lagrangian matheuristics for the quadratic multiple knapsack problem (Q6041829) (← links)
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
- Cutting and packing problems under uncertainty: literature review and classification framework (Q6056892) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
- The knapsack problem with forfeit sets (Q6109304) (← links)
- Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems (Q6109390) (← links)
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
- Knapsack problems with position-dependent item weights or profits (Q6165391) (← links)
- A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)
- On a cube and subspace projections (Q6488898) (← links)
