Abstract-- We present a new algorithm for solving a polynomial program P based on the recent "joint + marginal" approach of the first author for parametric polynomial opt...
Using different algorithms to segment different images is a quite straightforward strategy for automated image segmentation. But the difficulty of the optimal algorithm selection ...
— The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NPHard, high...
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...