Consider a graph G=(V,A), where V ={1,2,..,n} and A={(i,j): i,j=1,..,n, i â‰ j}. The TimeDependent Travelling Salesman problem (TDTSP) is to find a minimum cost Hamiltonian circuit, starting andâ€¦ (More)

Given a graph G with distinguished nodes s and t, a cost on each edge of G, and a fixed integer L â‰¥ 2, the two edge-disjoint hop-constrained paths problem is to find a minimum cost subgraph such thatâ€¦ (More)

The k edge-disjoint 2-hop-constrained paths problem consists in finding a minimum cost subgraph such that between two given nodes s and t there exist at least k edge-disjoint paths of at most 2â€¦ (More)

In this paper, we study the k edge-connected L-hop-constrained network design problem. Given a weighted graph G = (V,E), a set D of pairs of nodes, two integers L â‰¥ 2 and k â‰¥ 2, the problem consistsâ€¦ (More)

Providing a complete description of the stable set polytopes of claw-free graphs is a longstanding open problem since almost twenty years. Eisenbrandt et al. recently achieved a breakthrough for theâ€¦ (More)

We consider allocation problems that arise in the context of service allocation in Clouds. More specifically, on the one part we assume that each Physical Machine (denoted as PM) is offeringâ€¦ (More)