News
In this paper, we investigate possible approaches to study general time-inconsistent optimization problems without assuming the existence of optimal strategy. This leads immediately to the need to ...
A line of engineering research seeks to develop computers that can tackle a class of challenges called combinatorial ...
In this paper, we model this problem as an integer program and develop several fast route-first, cluster-second heuristics based on local search and dynamic programming. We prove worst-case ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results