A branch-and-bound algorithm for the quadratic multiple knapsack problem
Year of publication: |
2022
|
---|---|
Authors: | Fleszar, Krzysztof |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 298.2022, 1 (1.4.), p. 89-98
|
Subject: | Branch-and-bound | Fractional knapsack problem | Local search | Packing | Transportation problem | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound | Mathematische Optimierung | Mathematical programming | Operations Research | Operations research | Algorithmus | Algorithm |
-
A new combinatorial branch-and-bound algorithm for the Knapsack problem with conflicts
Coniglio, Stefano, (2021)
-
Neto, Teresa, (2013)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
- More ...
-
Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem
Fleszar, Krzysztof, (2011)
-
Charalambous, Christoforos, (2011)
-
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
Fleszar, Krzysztof, (2009)
- More ...