A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs

DOI10.1007/s10479-019-03290-3zbMath1467.90050OpenAlexW2957148222WikidataQ127464687 ScholiaQ127464687MaRDI QIDQ829173

Isma Dahmani, Mhand Hifi

Publication date: 5 May 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-019-03290-3

zbMATH Keywords

optimizationheuristicdescentknapsack

Mathematics Subject Classification ID

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

Related Items (3)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment ⋮ The knapsack problem with forfeit sets

Uses Software

• GLPK
• Knapsack
• GitHub

Cites Work

• Unnamed Item
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
• An efficient algorithm for the knapsack sharing problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• The Knapsack Problem with Conflict Graphs
• A reactive local search-based algorithm for the disjunctively constrained knapsack problem
• Discrete-Variable Extremum Problems
• Hiding information and signatures in trapdoor knapsacks

This page was built for publication: A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs