13376 search results - page 311 / 2676 » Problem Solving with |
143
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
215
click to vote
ICICIC
2006
IEEE
15 years 10 months ago
2006
IEEE
In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead ...
211
click to vote
AIPS
2011
14 years 7 months ago
2011
We define a probe to be a single action sequence computed greedily from a given state that either terminates in the goal or fails. We show that by designing these probes carefull...
151
click to vote
SAGA
2009
Springer
15 years 10 months ago
2009
Springer
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
179
click to vote
HEURISTICS
2010
14 years 11 months ago
2010
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...