A generalized approximation framework for fractional network flow and packing problems
Year of publication: |
February 2018
|
---|---|
Authors: | Holzhauser, Michael ; Krumke, Sven O. |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 87.2018, 1, p. 19-50
|
Subject: | Approximation algorithms | Fractional packing | Network flows | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Packproblem | Packing problem |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
An iterated greedy algorithm for the planning of yarn-dyeing boilers
Demir, Yunus, (2024)
-
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Zhang, Hao, (2023)
- More ...
-
A network simplex method for the budget-constrained minimum cost flow problem
Holzhauser, Michael, (2017)
-
An FPTAS for the knapsack problem with parametric weights
Halman, Nir, (2018)
-
Biogas im ländlichen Milieu : Zielgruppen und Trägerorganisationen in der Elfenbeinküste
Förster, Till, (1987)
- More ...