We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...
Many oil wells in Brazilian onshore fields rely on artificial lift methods. Maintenance services such as cleaning, reinstatement, stimulation and others are essential to these wel...
Dario J. Aloise, Daniel Aloise, Caroline T. M. Roc...
We consider the robust surgery loading problem for a hospital's operating theatre department, which concerns assigning surgeries and sufficient planned slack to operating roo...
Erwin W. Hans, Gerhard Wullink, Mark van Houdenhov...