Scutell Maria Grazia

Maria Grazia Scutell

Information about the author Maria Grazia Scutell will soon be added to the site.
Found 22 papers in total
Robust asset allocation strategies: relaxed versus classical robustness
Robust asset allocation strategies: relaxed versus classical robustness
2014
Many optimization problems involve parameters which are not known in advance, but can...
Robust portfolio asset allocation and risk measures
Robust portfolio asset allocation and risk measures
2013
Many financial optimization problems involve future values of security prices,...
Mixed Integer Non‐Linear Programming models for Green Network Design
Mixed Integer Non‐Linear Programming models for Green Network Design
2013
The paper focuses on Network Power Management in telecommunication infrastructures....
Color‐Coding Algorithms to the Balanced Path Problem: Computational Issues
Color‐Coding Algorithms to the Balanced Path Problem: Computational Issues
2011
Given a weighted directed network G , we consider the problem of computing k balanced...
Robust portfolio asset allocation and risk measures
Robust portfolio asset allocation and risk measures
2010
Many financial optimization problems involve future values of security prices,...
On improving optimal oblivious routing
On improving optimal oblivious routing
2009
In this paper a generalization of the robust network design problem with oblivious...
A multi-exchange heuristic for the single-source capacitated facility location problem
A multi-exchange heuristic for the single-source capacitated facility location problem
2004
We present a very large-scale neighborhood (VLSN) search algorithm for the capacitated...
A note on the parametric maximum flow problem and some related reoptimization issues
A note on the parametric maximum flow problem and some related reoptimization issues
2007
In this paper, we will extend the results about the parametric maximum flow problem to...
Distribution network design: New problems and related models
Distribution network design: New problems and related models
2005
We study some complex distribution network design problems, which involve facility...
Large-scale local search heuristics for the capacitated vertex p-center problem
Large-scale local search heuristics for the capacitated vertex p-center problem
2004
This article investigates the application of very large neighborhood search techniques...
A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
2004
We propose new local search algorithms for minimum makespan parallel machine...
An approximation algorithm for computing longest paths
An approximation algorithm for computing longest paths
2003
We show that the color-coding method of Alon et al ., in its version specialized to...
A new algorithm for reoptimizing shortest paths when the arc costs change
A new algorithm for reoptimizing shortest paths when the arc costs change
2003
We propose the first algorithmic approach which reoptimizes the shortest paths when...
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
2002
This paper investigates minimum time and minimum cost path problems in street networks...
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
2002
This paper investigates minimum time and minimum cost path problems in street networks...
Dynamic shortest paths minimizing travel times and costs
Dynamic shortest paths minimizing travel times and costs
2003
In this paper, we study dynamic shortest path problems that determine a shortest path...
A note on minimum makespan assembly plans
A note on minimum makespan assembly plans
2002
An important class of problems in manufacturing are those in which there is an item to...
Dual algorithms for the shortest path tree problem
Dual algorithms for the shortest path tree problem
1997
We consider dual approaches for the Shortest Path Tree problem. After a brief...
Flows on hypergraphs
Flows on hypergraphs
1997
We consider the capacitated minimum cost flow problem on directed hypergraphs. We...
The maximum flow problem: A max-preflow approach
The maximum flow problem: A max-preflow approach
1991
In the first part of the paper a general maximum flow procedure, which finds a maximum...
Strongly polynomial Auction algorithms for shortest path
Strongly polynomial Auction algorithms for shortest path
1991
An Auction algorithm for shortest paths was recently proposed by Bertsekas. Under the...
A modification of Lipski-Preparata’s algorithm for the maximum matching problem on bipartite convex graphs
A modification of Lipski-Preparata’s algorithm for the maximum matching problem on bipartite convex graphs
1988
The fastest algorithms appeared in the literature to solve the maximum matching...
Papers per page: