Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory t...
Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti
We define a new NP search problem, the “local improvement” principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the...
Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Ne...
The new market forces have affected the operation of distribution centers (DCs) extremely. The DCs demand an increased productivity and a low cost in their daily operation. This pa...
We consider a certain class of parallel program segments in which the order of messages sent affects the completion time. We give characterization of these parallel program segmen...
The lexicographically-ordered CSP ("lexicographic CSP" for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Prefe...