Sciweavers

2031 search results - page 83 / 407
» Approximation Algorithms for 2-Stage Stochastic Optimization...
Sort
View
FOCS
2000
IEEE
13 years 11 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
UAI
2003
13 years 9 months ago
An Importance Sampling Algorithm Based on Evidence Pre-propagation
Precision achieved by stochastic sampling algorithms for Bayesian networks typically deteriorates in face of extremely unlikely evidence. To address this problem, we propose the E...
Changhe Yuan, Marek J. Druzdzel
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
13 years 9 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
13 years 9 months ago
Accelerating convergence using rough sets theory for multi-objective optimization problems
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
Luis V. Santana-Quintero, Carlos A. Coello Coello
CCE
2004
13 years 8 months ago
Solving heat exchanger network synthesis problems with Tabu Search
: This paper describes the implementation of a meta-heuristic optimization approach, Tabu Search (TS), for Heat Exchanger Networks (HEN) synthesis and compares this approach to oth...
B. Lin, D. C. Miller