Sciweavers

518 search results - page 8 / 104
» Beating a Random Assignment
Sort
View
EOR
2006
103views more  EOR 2006»
14 years 11 months ago
Exact solutions to a class of stochastic generalized assignment problems
This paper deals with a stochastic Generalized Assignment Problem with recourse. Only a random subset of the given set of jobs will require to be actually processed. An assignment...
Maria Albareda-Sambola, Maarten H. van der Vlerk, ...
ICALP
2009
Springer
15 years 6 months ago
A Better Algorithm for Random k-SAT
Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. We present a polynomial time algorithm that finds a satisfying assignment of Φ with high p...
Amin Coja-Oghlan
IPCO
1992
115views Optimization» more  IPCO 1992»
15 years 26 days ago
When is the Assignment Bound Tight for the Asymmetric Traveling Salesman Problem?
We consider the probabilistic relationship between the value of a random asymmetric traveling salesman problem ATSP(M) and the value of its assignment relaxation AP(M). We assume ...
Alan M. Frieze, Richard M. Karp, Bruce A. Reed
INFORMATICALT
2000
113views more  INFORMATICALT 2000»
14 years 11 months ago
An Intensive Search Algorithm for the Quadratic Assignment Problem
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
Alfonsas Misevicius
AAAI
2004
15 years 1 months ago
Towards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
Wei Wei, Jordan Erenrich, Bart Selman