Grosso Andrea

Andrea Grosso

Information about the author Andrea Grosso will soon be added to the site.
Found 8 papers in total
Local search metaheuristics for the critical node problem
Local search metaheuristics for the critical node problem
2016
We present two metaheuristics for the Critical Node Problem, that is, the maximal...
Branch and cut algorithms for detecting critical nodes in undirected graphs
Branch and cut algorithms for detecting critical nodes in undirected graphs
2012
In this paper we deal with the critical node problem, where a given number of nodes...
Complexity of the critical node problem over trees
Complexity of the critical node problem over trees
2011
In this paper we deal with the critical node problem (CNP), i.e., the problem of...
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem
2004
The weakly NP-hard single-machine total tardiness scheduling problem has been...
A ‘maximum node clustering’ problem
A ‘maximum node clustering’ problem
2006
In this note we introduce a graph problem, called Maximum Node Clustering (MNC). We...
Optimal facility location with random throughput costs
Optimal facility location with random throughput costs
2002
In this paper we consider the optimal location and size of facilities where the...
Algorithmic paradoxes of the single-machine total tardiness problem
Algorithmic paradoxes of the single-machine total tardiness problem
2001
The paper deals with the single-machine total tardiness problem. It investigates the...
Solution of the single machine total tardiness problem
Solution of the single machine total tardiness problem
1999
The paper deals with the solution of the single machine total tardiness model. It...
Papers per page: