Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
Year of publication: |
2021
|
---|---|
Authors: | Galli, Laura ; Martello, Silvano ; Rey, Carlos ; Toth, Paolo |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 291.2021, 3 (16.6.), p. 871-882
|
Subject: | Binary quadratic programming | Combinatorial optimization | Lagrangian relaxation | Quadratic multiple knapsack | Reformulation linearization technique | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem |
-
Upper and lower bounding procedures for the multiple knapsack assignment problem
Kataoka, Seiji, (2014)
-
Nishi, Tatsushi, (2017)
-
Integer programming approaches for minimum stabbing problems
Piva, Breno, (2014)
- More ...
-
The quadratic knapsack problem with setup
Galli, Laura, (2025)
-
Effective metaheuristics for the latency location routing problem
Osorio-Mora, Alan, (2023)
-
Solution of the train platforming problem
Caprara, Alberto, (2011)
- More ...