LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup

DOI10.1111/itor.13213OpenAlexW4298394066MaRDI QIDQ6146649

Bassem Jarboui, Yassine Adouani, Malek Masmoudi

Publication date: 31 January 2024

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.13213

zbMATH Keywords

dynamic programmingmetaheuristicsvariable neighborhood searchLP relaxationmultiple knapsack problem with setup

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

Matheuristics: survey and synthesis ⋮ Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized quadratic multiple knapsack problem and two solution approaches
• A dynamic programming algorithm for the knapsack problem with setup
• An exact algorithm for the Knapsack problem with setup
• An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
• Knapsack problems with setups
• A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
• Dynamic programming algorithms for the zero-one knapsack problem
• A total-value greedy heuristic for the integer knapsack problem
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Variable neighborhood search
• An exact approach for the 0-1 knapsack problem with setups
• A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
• Exact approaches for the knapsack problem with setups
• The core concept for the Multidimensional Knapsack problem
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
• Mathematical models and decomposition methods for the multiple knapsack problem
• Variable neighborhood decomposition search
• A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
• A branch-and-bound algorithm for the quadratic multiple knapsack problem
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
• Greedy algorithm for the general multidimensional knapsack problem
• Computing Partitions with Applications to the Knapsack Problem
• Exact Algorithms For The Setup Knapsack Problem
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Sensitivity analysis of the setup knapsack problem to perturbation of arbitrary profits or weights
• Improved dynamic programming and approximation results for the knapsack problem with setups
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
• Variable neighborhood search: Principles and applications
• Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners

This page was built for publication: LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup