Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints
Year of publication: |
16 October 2018
|
---|---|
Authors: | Halman, Nir ; Kellerer, Hans ; Strusevič, Vitalij Aleksandrovič |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 270.2018, 2 (16.10.), p. 435-447
|
Subject: | Combinatorial optimization | Non-linear boolean programming | Geometric rounding | K-approximation sets and functions | FPTAS | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming |
-
Halman, Nir, (2020)
-
On speed scaling via integer programming
Karademir, Serdar, (2015)
-
Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint
Halman, Nir, (2023)
- More ...
-
Kellerer, Hans, (2009)
-
Preemptive scheduling on two identical parallel machines with a single transporter
Kellerer, Hans, (2013)
-
Kellerer, Hans, (2013)
- More ...