Pages that link to "Item:Q421557"

The following pages link to The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557):

Displaying 8 items.

• Determining the \(K\)-best solutions of knapsack problems (Q342015) (← 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)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem (Q2255966) (← links)
• One-dimensional stock cutting: optimization of usable leftovers in consecutive orders (Q2401325) (← 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)