The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Traditional remote controls typically allow users to activate functionality of a single device. Given that users activate a subset of functionality across devices to accomplish a p...
Olufisayo Omojokun, Jeffrey S. Pierce, Charles Lee...
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
—A principal challenge in modern computational finance is efficient portfolio design – portfolio optimization followed by decision-making. Optimization based on even the widely...
Raj Subbu, Piero P. Bonissone, Neil Eklund, Sriniv...