Pages that link to "Item:Q2643951"
From MaRDI portal
The following pages link to The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951):
Displaying 12 items.
- The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
- On solving the double loading problem using a modified particle swarm optimization (Q496039) (← links)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- Approximation schemes for knapsack problems with shelf divisions (Q818116) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- A heuristic for the problem of one-dimensional steel coil cutting (Q1983859) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- A one-dimensional bin packing problem with shelf divisions (Q2482104) (← links)
- The 1-Neighbour Knapsack Problem (Q3111641) (← links)
- A note on dual approximation algorithms for class constrained bin packing problems (Q3625691) (← links)
- A strong integer linear optimization model to the compartmentalized knapsack problem (Q6088168) (← links)
- An integer linear optimization model to the compartmentalized knapsack problem (Q6088172) (← links)