Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization

•Root cause analysis of hardness of problems with sigmoid utility.•Design of hybrid algorithms merging continuous and discrete optimization.•Constant factor algorithm for knapsack problem with sigmoid utility.•Constant factor algorithm for generalized assignment problem with sigmoid utility.•Approxi...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:European journal of operational research Ročník 236; číslo 2; s. 488 - 498
Hlavní autori: Srivastava, Vaibhav, Bullo, Francesco
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 16.07.2014
Elsevier Sequoia S.A
Predmet:
Algorithms
Approximation
Assignment problem
Bin-packing problem
Generalized assignment problem
Human attention allocation
Knapsack problem
Multi-choice knapsack problem
Optimization
Optimization algorithms
Packing problem
Sigmoid utility/S-curve
Studies
Sigmoid utility/S-curve
Generalized assignment problem
Multi-choice knapsack problem
Bin-packing problem
Human attention allocation
Knapsack problem
ISSN:0377-2217, 1872-6860
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•Root cause analysis of hardness of problems with sigmoid utility.•Design of hybrid algorithms merging continuous and discrete optimization.•Constant factor algorithm for knapsack problem with sigmoid utility.•Constant factor algorithm for generalized assignment problem with sigmoid utility.•Approximation algorithm for bin-packing problem with sigmoid utility. We study a class of non-convex optimization problems involving sigmoid functions. We show that sigmoid functions impart a combinatorial element to the optimization variables and make the global optimization computationally hard. We formulate versions of the knapsack problem, the generalized assignment problem and the bin-packing problem with sigmoid utilities. We merge approximation algorithms from discrete optimization with algorithms from continuous optimization to develop approximation algorithms for these NP-hard problems with sigmoid utilities.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2013.12.035