# Pierre Hosteins

- Dipartimento di Informatica - Università di Torino

C.So Svizzera, 185, I-10149 Torino, Italy

We study a prize-collecting single-machine scheduling problem with hard deadlines, where the objective is to minimize the difference between the total tardiness and the total prize of the selected jobs. This problem is motivated by...

We consider the *Critical Node Problem *: given an undirected graph and an
integer number $K$, at most $K$ nodes have to be deleted from the graph in order
to minimize a connectivity measure in the residual graph.
We combine the...

We study a prize-collecting single-machine scheduling problem with hard deadlines, where the objective is to minimize the difference between the total tardiness and the total prize of the selected jobs. This problem is motivated by...

We consider the *Critical Node Problem *: given an undirected graph and an
integer number $K$, at most $K$ nodes have to be deleted from the graph in order
to minimize a connectivity measure in the residual graph.
We combine the...