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...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 236; no. 2; pp. 488 - 498
Main Authors:	Srivastava, Vaibhav, Bullo, Francesco
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 16.07.2014 Elsevier Sequoia S.A
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!