A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
DOI10.1016/j.ins.2018.01.026zbMath1440.90062OpenAlexW2783833771MaRDI QIDQ2195439
Xiangjing Lai, Zhipeng Lü, Jin-Kao Hao, Fred Glover
Publication date: 8 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.01.026
combinatorial optimizationmeta-heuristicsmultidimensional knapsack problemsolution-based tabu search
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (11)
Uses Software
Cites Work
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
- Essential particle swarm optimization queen with tabu search for MKP resolution
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
- A multi-level search strategy for the 0-1 multidimensional knapsack problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
- A memetic algorithm for graph coloring
- A simulated annealing approach to the multiconstraint zero-one knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- A note on hashing functions and tabu search algorithms
- Tutorial on surrogate constraint approaches for optimization in graphs
- The multidimensional 0-1 knapsack problem: an overview.
- An efficient tabu search approach for the 0-1 multidimensional knapsack problem
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Improved results on the 0--1 multidimensional knapsack problem
- A hybrid metaheuristic method for the maximum diversity problem
- Hashing vectors for tabu search
- Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
- CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
- The Multidimensional Knapsack Problem: Structure and Algorithms
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Surrogate Constraints
- The Theory and Computation of Knapsack Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem