Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
From MaRDI portal
Publication:1730435
DOI10.1007/s10479-017-2675-0zbMath1411.90286OpenAlexW2762562427MaRDI QIDQ1730435
Bahram Alidaee, Vijay P. Ramalingam, Haibo Wang, Bryan Kethley
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-017-2675-0
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The multidimensional 0-1 knapsack problem: an overview.
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Future paths for integer programming and links to artificial intelligence
- Dynamic tabu list management using the reverse elimination method
- Greedy algorithm for the general multidimensional knapsack problem
- Twenty years of linear programming based portfolio optimization
- CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
- A survey of effective heuristics and their application to a variety of knapsack problems
- Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
This page was built for publication: Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem