- This paper presents an optimal algorithm for solving the problem of simultaneous fanout optimization and routing tree construction for an ordered set of critical sinks. The algor...
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
We use a decomposition approach to generate cooperative strategies for a class of multi-vehicle control problems. By introducing a set of tasks to be completed by the team of vehi...
Abstract. There is a variety of methods for ranking objectives in multiobjective optimization and some are difficult to define because they require information a priori (e.g. esta...