A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
type: Item
instance of: scholarly article
title: A matheuristic for the 0--1 generalized quadratic multiple knapsack problem
zbMATH Open document ID: 1483.90127
author: Yassine Adouani
author: Bassem Jarboui
author: M. Masmoudi
published in: Optimization Letters
publication date: 2022-01-21T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7461739
zbMATH Keywords: generalized quadratic knapsack problem
zbMATH Keywords: linearization
zbMATH Keywords: matheuristic
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: integer programing
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: s11590-019-01503-z
OpenAlex ID: W2988958700
Wikidata QID: Q126832186
cites work: Exact Algorithms For The Setup Knapsack Problem
cites work: A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
cites work: Generalized quadratic multiple knapsack problem and two solution approaches
cites work: The quadratic knapsack problem -- a survey
cites work: Min-cut clustering
cites work: Q3835301
cites work: Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
cites work: Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
cites work: Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem
cites work: An ejection chain approach for the quadratic multiple knapsack problem
cites work: Hybridizing exact methods and metaheuristics: a taxonomy
cites work: Q4418381
cites work: A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
cites work: An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem
cites work: A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines
cites work: Linear programming for the \(0-1\) quadratic knapsack problem
cites work: New trends in exact algorithms for the \(0-1\) knapsack problem
cites work: Variable neighborhood search
cites work: Variable neighborhood search: basics and variants
cites work: Variable neighborhood search for location routing
cites work: Zero-one programming with many variables and few constraints
DOI: 10.1007/S11590-019-01503-Z
description: scientific article; zbMATH DE number 7461739