2009 |
17 | EE | Daniela Ambrosino,
Anna Sciomachen,
Maria Grazia Scutellà:
A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem.
Computers & OR 36(2): 442-460 (2009) |
2008 |
16 | EE | Giorgio Gallo,
Maria Grazia Scutellà:
Foreword.
Networks 51(1): 1-3 (2008) |
15 | EE | Maria Grazia Scutellà:
The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case.
Networks 51(2): 102-112 (2008) |
2007 |
14 | EE | Maria Grazia Scutellà:
A note on the parametric maximum flow problem and some related reoptimization issues.
Annals OR 150(1): 231-244 (2007) |
2005 |
13 | EE | Daniela Ambrosino,
Maria Grazia Scutellà:
Distribution network design: New problems and related models.
European Journal of Operational Research 165(3): 610-624 (2005) |
12 | EE | Paola Cappanera,
Maria Grazia Scutellà:
Balanced paths in acyclic networks: Tractable cases and related approaches.
Networks 45(2): 104-111 (2005) |
2004 |
11 | EE | Antonio Frangioni,
Emiliano Necciari,
Maria Grazia Scutellà:
A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems.
J. Comb. Optim. 8(2): 195-220 (2004) |
10 | EE | Maria Paola Scaparra,
Stefano Pallottino,
Maria Grazia Scutellà:
Large-scale local search heuristics for the capacitated vertex p-center problem.
Networks 43(4): 241-255 (2004) |
2003 |
9 | EE | Maria Grazia Scutellà:
An approximation algorithm for computing longest paths.
European Journal of Operational Research 148(3): 584-590 (2003) |
8 | EE | Ravindra K. Ahuja,
James B. Orlin,
Stefano Pallottino,
Maria Grazia Scutellà:
Dynamic shortest paths minimizing travel times and costs.
Networks 41(4): 197-205 (2003) |
7 | EE | Stefano Pallottino,
Maria Grazia Scutellà:
A new algorithm for reoptimizing shortest paths when the arc costs change.
Oper. Res. Lett. 31(2): 149-160 (2003) |
2002 |
6 | EE | Giorgio Gallo,
Maria Grazia Scutellà:
A note on minimum makespan assembly plans.
European Journal of Operational Research 142(2): 309-320 (2002) |
1998 |
5 | EE | Maria Grazia Scutellà:
A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem.
Discrete Applied Mathematics 81(1-3): 123-131 (1998) |
1997 |
4 | | Riccardo Cambini,
Giorgio Gallo,
Maria Grazia Scutellà:
Flows on hypergraphs.
Math. Program. 77: 195-217 (1997) |
3 | EE | Stefano Pallottino,
Maria Grazia Scutellà:
Dual algorithms for the shortest path tree problem.
Networks 29(2): 125-133 (1997) |
1990 |
2 | | Maria Grazia Scutellà:
A Note on Dowling and Gallier's Top-Down Algorithm for Propositional Horn Satisfiability.
J. Log. Program. 8(3): 265-273 (1990) |
1988 |
1 | | Giorgio Gallo,
Maria Grazia Scutellà:
Polynomially Solvable Satisfiability Problems.
Inf. Process. Lett. 29(5): 221-227 (1988) |