840 search results - page 12 / 168 » Inapproximability of Combinatorial Optimization Problems |
ICTAI
2005
IEEE
14 years 4 months ago
2005
IEEE
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
ORL
2008
13 years 10 months ago
2008
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
CCO
2001
Springer
14 years 3 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
FSTTCS
2010
Springer
13 years 9 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
CP
2000
Springer
14 years 3 months ago
2000
Springer
Constraint programming offers a variety of modeling objects such as logical and global constraints, that lead to concise and clear models for expressing combinatorial optimization...