Search Results for author:
Found 5 papers, 2 papers with code
Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming
However, many of the methods used rely on general-purpose solvers for which scalability remains an issue.
The Maintenance Location Choice Problem for Railway Rolling Stock
Due to increasing railway use, the capacity at railway yards and maintenance locations is becoming limiting to accommodate existing rolling stock.
Optimization and Control Discrete Mathematics Systems and Control Systems and Control 90-10
Benchmarking Flexible Electric Loads Scheduling Algorithms under Market Price Uncertainty
Because of increasing amounts of intermittent and distributed generators in power systems, many demand response programs have been developed to schedule flexible energy consumption.
Solving Transition-Independent Multi-agent MDPs with Sparse Interactions (Extended version)
In cooperative multi-agent sequential decision making under uncertainty, agents must coordinate to find an optimal joint policy that maximises joint value.
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
They make use of directed path consistency along a vertex ordering d. Both algorithms run in O(n^2 w_d) time, where w_d is the graph width induced by this vertex ordering.
