Pages that link to "Item:Q732881"
From MaRDI portal
The following pages link to A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem (Q732881):
Displaying 11 items.
- Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
- HMS: a hybrid multi-start algorithm for solving binary linear programs (Q1791895) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
- An ant colony optimization approach for the multidimensional knapsack problem (Q2267820) (← links)
- A new ant colony optimization algorithm for the multidimensional Knapsack problem (Q2471237) (← links)
- Algorithms for single-machine scheduling problem with deterioration depending on a novel model (Q2628177) (← links)
- A hybrid distribution estimation algorithm for solving multidimensional knapsack problems (Q2916071) (← links)
- Hybrid optimization algorithm of ant colony optimization and Lagrangian relaxation for solving multidimensional knapsack problem (Q2983735) (← links)
- Yard Crane Scheduling in the Ground Trolley-Based Automated Container Terminal (Q5112420) (← links)
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets (Q6667807) (← links)
