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 ...

Omega 11 (4):403–408. Behdani B, Smith JC (2014) An integer-programming-based approach to the close-enough traveling salesman problem. INFORMS J. Comput. 26 (3):415–432. Belenguer JM, Benavent E, ...