#### Filter Results:

- Full text PDF available (25)

#### Publication Year

1988

2016

- This year (0)
- Last 5 years (11)
- Last 10 years (25)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Paola Scaparra, Maria Grazia Scutellà
- Management Science
- 2004

This paper presents a very large scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. The neighborhood structures are induced by customer multi-exchanges and by facility moves. We consider both single-customer multi-exchanges, detected on a suitably de ned customer improvement graph, and… (More)

- Daniela Ambrosino, Maria Grazia Scutellà
- European Journal of Operational Research
- 2005

- Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia Scutellà
- Networks
- 2007

The authors settle the complexity status of the robust network design problem in undirected graphs. The fact that the flow-cut gap in general graphs can be large, poses some difficulty in establishing a hardness result. Instead, the authors introduce a single-source version of the problem where the flow-cut gap is known to be one. They then show that this… (More)

- Giorgio Gallo, Maria Grazia Scutellà
- Inf. Process. Lett.
- 1988

Shortest Path Problems are among the most studied network flow optimization problems, with interesting applications in various fields. One such field is transportation, where shortest path problems of different kinds need to be solved. Due to the nature of the application, transportation scientists need very flexible and efficient shortest path procedures,… (More)

- Ravindra K. Ahuja, James B. Orlin, Stefano Pallottino, Maria Grazia Scutellà
- Networks
- 2003

In this paper, we study dynamic shortest path problems, which is to determine a shortest path from a specified source node to every other node in the network where arc travel times change dynamically. We consider two problems: the minimum time walk problem (which is to find a walk with the minimum travel time) and the minimum cost walk problem (which is to… (More)

We propose new local search algorithms for minimum makespan machine scheduling problems, which perform multiple exchanges of jobs among machines. Inspired by the work of Thompson and Orlin (1989) on cyclic transfer neighborhood structures, we model multiple exchanges of jobs as special disjoint cycles and paths in a suitably defined improvement graph, by… (More)

- Antonio Frangioni, Emiliano Necciari, Maria Grazia Scutellà
- J. Comb. Optim.
- 2004

- Maria Paola Scaparra, Stefano Pallottino, Maria Grazia Scutellà
- Networks
- 2004

- Maria Grazia Scutellà
- Oper. Res. Lett.
- 2009