Lagrangian matheuristics for the quadratic multiple knapsack problem

DOI10.1016/J.DAM.2022.06.033zbMATH Open1519.90204MaRDI QIDQ6041829FDOQ6041829

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

Publication date: 15 May 2023

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

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

zbMATH Keywords

combinatorial optimizationknapsack problemsLagrangian relaxationmatheuristics

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Reducibility among combinatorial problems
• Title not available (Why is that?)
• Generalized Bundle Methods
• Iterated responsive threshold search for the quadratic multiple knapsack problem
• Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
• Exact Solution of the Quadratic Knapsack Problem
• Generalized quadratic multiple knapsack problem and two solution approaches
• Strategic oscillation for the quadratic multiple knapsack problem
• Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
• A branch-and-bound algorithm for the quadratic multiple knapsack problem
• 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
• An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems

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)