Sciweavers

838 search results - page 95 / 168
» Finding Optimal Solutions to Atomix
Sort
View
MP
2008
103views more  MP 2008»
14 years 12 months ago
Aggregation and discretization in multistage stochastic programming
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
Daniel Kuhn
SIAMCOMP
2008
108views more  SIAMCOMP 2008»
14 years 11 months ago
The Euclidean Orienteering Problem Revisited
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
Ke Chen 0006, Sariel Har-Peled
HEURISTICS
2002
146views more  HEURISTICS 2002»
14 years 11 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...
KBS
2002
98views more  KBS 2002»
14 years 11 months ago
Integrating AI planning techniques with workflow management system
There is a variety of applications that can benefit from the ability to find optimal or good solutions to a proposed problem automatically. The Artificial Intelligent (AI) communi...
María Dolores Rodríguez-Moreno, Paul...
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
14 years 9 months ago
Reduced complexity models in the identification of dynamical networks: Links with sparsification problems
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
Donatello Materassi, Giacomo Innocenti, Laura Giar...