Sciweavers

1026 search results - page 168 / 206
» On Finding Minimal w-cutset
Sort
View
WSC
2008
13 years 11 months ago
Simulation-based, optimized scheduling of limited bar-benders over multiple building sites
In the construction industry, a specialist subcontractor manages a taskforce of single-skilled laborers to work on multiple construction sites, aiming to minimize the total cost a...
Hoi-Ching Lam, Ming Lu
WSC
2008
13 years 11 months ago
Simulation based optimization of multi-location transshipment problem with capacitated transportation
In this study, a single-item two-echelon inventory system where the items can be stored in each of N stocking locations is optimized using simulation. The aim of this study is to ...
Banu Yetkin Ekren, Sunderesh S. Heragu
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
ATAL
2008
Springer
13 years 11 months ago
Trading off solution cost for smaller runtime in DCOP search algorithms
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
William Yeoh, Sven Koenig, Xiaoxun Sun