We introduce a convex relaxation framework to optimally
minimize continuous surface ratios. The key idea is to minimize
the continuous surface ratio by solving a sequence
of con...
Kalin Kolev (University of Bonn), Daniel Cremers (...
Abstract—In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with Time Windows (CV...
We address computational issues relevant to the study of disordered quantum mechanical systems at very low temperatures. As an example we consider the disordered BoseHubbard model...
Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among ...