An effective dynamic programming algorithm for the minimum-cost maximal knapsack packing problem
Year of publication: |
16 October 2017
|
---|---|
Authors: | Furini, Fabio ; Ljubić, Ivana ; Sinnl, Markus |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 262.2017, 2 (16.10.), p. 438-448
|
Subject: | Combinatorial optimization | Maximal knapsack packing | Minimal knapsack cover | Dynamic programming | Integer programming | Theorie | Theory | Beziehungsmarketing | Relationship marketing | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Dynamische Optimierung | Packproblem | Packing problem |
-
One-dimensional stock cutting resilient against singular random defects
Arbib, Claudio, (2023)
-
A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem
Fomeni, Franklin Djeumou, (2021)
-
Temporal bin packing with half-capacity jobs
Muir, Christopher, (2024)
- More ...
-
A computational study of exact approaches for the bi-objective prize-collecting steiner tree problem
Leitner, Markus, (2015)
-
An exact method for binary fortification games
Leitner, Markus, (2023)
-
Interdiction games and monotonicity, with application to knapsack problems
Fischetti, Matteo, (2019)
- More ...