Lagrangian matheuristics for the quadratic multiple knapsack problem

DOI10.1016/J.DAM.2022.06.033MaRDI QIDQ6041829zbMATH OpenFDO

Authors Laura Galli, Silvano Martello, Carlos Rey, Paolo Toth

Publication date 15 May 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationknapsack problemsLagrangian relaxationmatheuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Lagrangian heuristics for the quadratic knapsack problem
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
• A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
• Exact Solution of the Quadratic Knapsack Problem
• A Lagrangian dual and surrogate method for multi-dimensional quadratic knapsack problems

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A branch-and-bound algorithm for the quadratic multiple knapsack problem
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
• Exact Solution of the Quadratic Knapsack Problem
• Generalized Bundle Methods
• Generalized quadratic multiple knapsack problem and two solution approaches
• Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
• Iterated responsive threshold search 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
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
• Reducibility among combinatorial problems
• Strategic oscillation for the quadratic multiple knapsack problem
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem

Cited in

(7)

• A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
• Strategic oscillation for the quadratic multiple knapsack problem
• Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
• Lagrangian heuristics for the quadratic knapsack problem
• A Lagrangian dual and surrogate method for multi-dimensional quadratic knapsack problems
• Generalized quadratic multiple knapsack problem and two solution approaches
• Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets

This page was built for publication: Lagrangian matheuristics for the quadratic multiple knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041829)