66 search results - page 1 / 14 » Easy distributions for combinatorial optimization problems w... |
ORL
2010
12 years 11 months ago
2010
We show how we can linearize probabilistic linear constraints with binary variables when all coefficients are distributed according to either N(
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
IJCAI
2001
13 years 6 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
AAAI
2006
13 years 6 months ago
2006
We present a new formulation of distributed task assignment, called Generalized Mutual Assignment Problem (GMAP), which is derived from an NP-hard combinatorial optimization probl...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...