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 | Ganzzahlige Optimierung | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung | Packproblem | Packing problem | Algorithmus | Algorithm |
-
Durak, Bahadır, (2017)
-
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Zhang, Hao, (2023)
-
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)
-
ILP heuristics and a new exact method for bi-objective 0/1 ILPs : application to FTTx-network design
Leitner, Markus, (2016)
-
Leitner, Markus, (2018)
- More ...