Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
type: Item
instance of: scholarly article
title: Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
author: Raka Jovanovic
author: Stefan Voß
published in: OR Spectrum
publication date: 2025-01-21T00:00:00Z
Mathematics Subject Classification ID: 90Cxx
zbMATH DE Number: 7971821
zbMATH Keywords: metaheuristics
zbMATH Keywords: multidimensional knapsack problem
zbMATH Keywords: knapsack problem with forfeit sets
zbMATH Keywords: fixed set search
zbMATH Keywords: matheuristic
MaRDI profile type: Publication
cites work: A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
cites work: Kernel search: a general heuristic for the multi-dimensional knapsack problem
cites work: A multi-level search strategy for the 0-1 multidimensional knapsack problem
cites work: A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem
cites work: A genetic algorithm for the multidimensional knapsack problem
cites work: A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
cites work: Dynamic tabu list management using the reverse elimination method
cites work: A simulated annealing approach to the multiconstraint zero-one knapsack problem
cites work: The knapsack problem with forfeit sets
cites work: Greedy randomized adaptive search procedures
cites work: The multidimensional 0-1 knapsack problem: an overview.
cites work: Lagrangian matheuristics for the quadratic multiple knapsack problem
cites work: Q4198056
cites work: The Theory and Computation of Knapsack Functions
cites work: Q4350063
cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem
cites work: Fixed set search applied to the clique partitioning problem
cites work: A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
cites work: Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
cites work: A Fast Algorithm for Knapsack Problem with Conflict Graph
cites work: The multiple multidimensional knapsack with family-split penalties
cites work: CORAL: an exact algorithm for the multidimensional knapsack problem
cites work: The Knapsack Problem with Conflict Graphs
cites work: Heuristic concentration: Two stage solution construction
cites work: Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
cites work: Q4495192
cites work: POPMUSIC -- partial optimization metaheuristic under special intensification conditions
cites work: Improved results on the 0--1 multidimensional knapsack problem
cites work: Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
cites work: Q4395336
cites work: Proposals for chunking and tabu search
DOI: 10.1007/S00291-024-00746-2
description: scientific article; zbMATH DE number 7971821