The following pages link to (Q4350067):
Displaying 13 items.
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- General purpose heuristics for integer programming. I (Q1365114) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
- Solving zero-one mixed integer programming problems using tabu search (Q1609922) (← links)
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem (Q1609923) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Tabu search tutorial. A graph drawing application (Q1979170) (← links)
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
- Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
- Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List (Q2773172) (← links)
- Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
