An FPTAS for the knapsack problem with parametric weights
Year of publication: |
September 2018
|
---|---|
Authors: | Halman, Nir ; Holzhauser, Michael ; Krumke, Sven O. |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 46.2018, 5, p. 487-491
|
Subject: | Knapsack problems | Parametric optimization | Approximation algorithms | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
Halman, Nir, (2023)
-
Exact approaches for the knapsack problem with setups
Furini, Fabio, (2018)
-
On a variant of the change-making problem
Letchford, Adam N., (2024)
- More ...
-
A network simplex method for the budget-constrained minimum cost flow problem
Holzhauser, Michael, (2017)
-
A generalized approximation framework for fractional network flow and packing problems
Holzhauser, Michael, (2018)
-
Biogas im ländlichen Milieu : Zielgruppen und Trägerorganisationen in der Elfenbeinküste
Förster, Till, (1987)
- More ...