A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
From MaRDI portal
Publication:2070116
DOI10.1007/s11590-019-01503-zzbMath1483.90127OpenAlexW2988958700WikidataQ126832186 ScholiaQ126832186MaRDI QIDQ2070116
Yassine Adouani, Malek Masmoudi, Bassem Jarboui
Publication date: 21 January 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01503-z
linearizationvariable neighborhood searchmatheuristicinteger programinggeneralized quadratic knapsack problem
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An ejection chain approach for the quadratic multiple knapsack problem
- Generalized quadratic multiple knapsack problem and two solution approaches
- Variable neighborhood search for location routing
- Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
- The quadratic knapsack problem -- a survey
- A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines
- An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
- Hybridizing exact methods and metaheuristics: a taxonomy
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Zero-one programming with many variables and few constraints
- Linear programming for the \(0-1\) quadratic knapsack problem
- Min-cut clustering
- Variable neighborhood search
- New trends in exact algorithms for the \(0-1\) knapsack problem
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Variable neighborhood search: basics and variants
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
- Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
- Exact Algorithms For The Setup Knapsack Problem
This page was built for publication: A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
