Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
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
A simulated annealing approach to the multiconstraint zero-one knapsack problem
A genetic algorithm for the multidimensional knapsack problem
Heuristic concentration: Two stage solution construction
The multidimensional 0-1 knapsack problem: an overview.
Proposals for chunking and tabu search
An efficient tabu search approach for the 0-1 multidimensional knapsack problem
Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
Improved results on the 0--1 multidimensional knapsack problem
Greedy randomized adaptive search procedures
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
The multiple multidimensional knapsack with family-split penalties
A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
Dynamic tabu list management using the reverse elimination method
Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem
The Knapsack Problem with Conflict Graphs
A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
A Fast Algorithm for Knapsack Problem with Conflict Graph
The Theory and Computation of Knapsack Functions
Lagrangian matheuristics for the quadratic multiple knapsack problem
Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
The knapsack problem with forfeit sets
Fixed set search applied to the clique partitioning problem

This page was built for publication: Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets