A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem
Year of publication: |
2025
|
---|---|
Authors: | Hochbaum, Dorit S. ; Baumann, Philipp ; Goldschmidt, O. ; Zhang, Yiqing |
Published in: |
European journal of operational research : EJOR. - Amsterdam [u.a.] : Elsevier, ISSN 0377-2217, ZDB-ID 1501061-2. - Vol. 323.2025, 2 (1.6.), p. 425-440
|
Subject: | Breakpoints algorithm | Combinatorial optimization | Greedy algorithm | Parametric cut | Quadratic Knapsack problem | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem |
-
A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem
Hifi, Mhand, (2023)
-
Temporal bin packing with half-capacity jobs
Muir, Christopher, (2024)
-
A novel dynamic programming heuristic for the quadratic knapsack problem
Fennich, M. Eliass, (2024)
- More ...
-
Obituary for Professor Emeritus Jakob Kraurp
Schöbel, Anita, (2023)
-
Algorithms and complexities of matching variants in covariate balancing
Hochbaum, Dorit S., (2023)
-
Rating customers according to their promptness to adopt new products
Hochbaum, Dorit S., (2011)
- More ...