Sciweavers

121
Voted
CPAIOR
2008
Springer
15 years 2 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck
CPAIOR
2008
Springer
15 years 2 months ago
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Daniel H. Leventhal, Meinolf Sellmann
CPAIOR
2008
Springer
15 years 2 months ago
Counting Solutions of Knapsack Constraints
Abstract. This paper furthers the recent investigation of search heuristics based on solution counting information, by proposing and evaluating algorithms to compute solution densi...
Gilles Pesant, Claude-Guy Quimper
114
Voted
CPAIOR
2008
Springer
15 years 2 months ago
Gap Reduction Techniques for Online Stochastic Project Scheduling
Anticipatory algorithms for online stochastic optimization have been shown very effective in a variety of areas, including logistics, reservation systems, and scheduling. For such ...
Grégoire Dooms, Pascal Van Hentenryck
Operations Research
Top of PageReset Settings