A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
type: Item
instance of: scholarly article
title: A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs
zbMATH Open document ID: 1467.90050
author: Isma Dahmani
author: Mhand Hifi
published in: Annals of Operations Research
publication date: 2021-05-05T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7344541
zbMATH Keywords: descent
zbMATH Keywords: heuristic
zbMATH Keywords: knapsack
zbMATH Keywords: optimization
describes a project that uses: GLPK
describes a project that uses: Knapsack
describes a project that uses: GitHub
MaRDI profile type: Publication
full work available at URL: s10479-019-03290-3
OpenAlex ID: W2957148222
cites work: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
cites work: Discrete-Variable Extremum Problems
cites work: A reactive local search-based algorithm for the disjunctively constrained knapsack problem
cites work: Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
cites work: An efficient algorithm for the knapsack sharing problem
cites work: Q4821303
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Hiding information and signatures in trapdoor knapsacks
cites work: The Knapsack Problem with Conflict Graphs
Wikidata QID: Q127464687
DOI: 10.1007/S10479-019-03290-3
Recommended article: A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Recommended article: A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
Recommended article: An improved direct descent algorithm for binary knapsack problems
Recommended article: A Fast Algorithm for Knapsack Problem with Conflict Graph
Recommended article: Approximation of knapsack problems with conflict and forcing graphs
Recommended article: The Knapsack Problem with Conflict Graphs
Recommended article: A branch-and-bound algorithm for the quadratic multiple knapsack problem
Recommended article: Q3395302
Recommended article: The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints
Recommended article: A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
description: scientific article; zbMATH DE number 7344541