Extension of Reverse Elimination Method through a dynamic management of the tabu list

RAIRO Recherche Operationnelle

Volumn 35, Issue 2, 2001, Pages 251-267

  Hanafi, S ^a   Freville A ^a  

^a UNIVERSITÉ DE VALENCIENNES   (France)

Author keywords

0 1 multidimensional knapsack; Reverse Elimination Method; Strategic oscillation; Tabu search

Indexed keywords

HEURISTIC METHODS; INTEGER PROGRAMMING;

DYNAMIC MANAGEMENT; REVERSE ELIMINATION METHOD (REM);

OPERATIONS RESEARCH;

EID: 0035314692     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro:2001113     Document Type: Article

References (17)

1. Tabu search for general zero-one integer programs using the pivot and complement heuristic
2. The reactive Tabu Search
3. Dynamic tabu list management using the reverse elimination method
4. Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
5. Hard 0-1 multiknapsack test problems for size reduction methods
6. Tabu search, Part 1
7. Tabu search, Part 2
8. Tabu search and finite convergence
9. Critical events Tabu search for multidimensional knapsack problems
10. On the convergence of Tabu Search
11. An efficient Tabu Search approach for the 0-1 multidimensional Knapsack problem
12. Comparison of heuristics for the 0-1 multidimensional Knapsack problem
13. Applying Tabu Search with influential diversification to multi-processor scheduling
14. Probabilistic move selection in Tabu Search for zero-one mixed integer programming problems
15. Three problems in capital rationing
16. A Tabu Search approach to the CSP (Constraint Satisfaction Problem) as a general problem solver