We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
Samuel Fiorini, Gianpaolo Oriolo, Laura Sanit&agra...
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
We present a stochastic approximation method to compute bid prices in network revenue management problems. The key idea is to visualize the total expected revenue as a function of...
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...