Knapsack problems with sigmoid utilities : approximation algorithms via hybrid optimization
Year of publication: |
2014
|
---|---|
Authors: | Srivastava, Vaibhav ; Bullo, Francesco |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 236.2014, 2 (16.7.), p. 488-498
|
Subject: | Sigmoid utility/S-curve | Knapsack problem | Bin-packing problem | Multi-choice knapsack problem | Human attention allocation | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization
Srivastava, Vaibhav, (2014)
-
The Knapsack Problem with forfeit sets
D'Ambrosio, Ciriaco, (2023)
-
Integer optimization with penalized fractional values : the Knapsack case
Malaguti, Enrico, (2019)
- More ...
-
Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization
Srivastava, Vaibhav, (2014)
-
Environmental issues surrounding human overpopulation
Singh, Rajeev Pratap, (2017)
-
Dynamic Vehicle Routing for Translating Demands: Stability Analysis and Receding-Horizon Policies
Bopardikar, Shaunak D., (2010)
- More ...