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 ; Strusevich, Vitaly A. |
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 | Nichtlineare Optimierung | Nonlinear programming |
-
Mathematical programming techniques in water network optimization
D'Ambrosio, Claudia, (2015)
-
A branch-and-price approach for the continuous multifacility monotone ordered median problem
Blanco, Víctor, (2023)
-
Randomized decomposition solver with the quadratic assignment problem as a case study
Mihić, Krešimir, (2018)
- More ...
-
Kellerer, Hans, (2013)
-
The symmetric quadratic knapsack problem : approximation and scheduling applications
Kellerer, Hans, (2012)
-
Preemptive scheduling on two identical parallel machines with a single transporter
Kellerer, Hans, (2013)
- More ...