Maria Grazia Scutella'
Citata da
Citata da
Distribution network design: New problems and related models
D Ambrosino, M Grazia ScutellÓ
European Journal of Operational Research 165 (3), 610-624, 2005
Shortest path algorithms in transportation models: classical and innovative aspects
S Pallottino, MG Scutella
Equilibrium and advanced transportation modelling, 245-281, 1998
A multi-exchange heuristic for the single-source capacitated facility location problem
RK Ahuja, JB Orlin, S Pallottino, MP Scaparra, MG Scutella
Management Science, 749-760, 2004
Joint assignment, scheduling, and routing models to home care optimization: A pattern-based approach
P Cappanera, MG ScutellÓ
Transportation Science 49 (4), 830-852, 2015
Dynamic shortest paths minimizing travel times and costs
RK Ahuja, JB Orlin, S Pallottino, MG Scutella
Networks: An International Journal 41 (4), 197-205, 2003
Demand uncertainty in robust home care optimization
P Cappanera, MG ScutellÓ, F Nervi, L Galli
Omega 80, 95-110, 2018
Hardness of robust network design
C Chekuri, FB Shepherd, G Oriolo, MG ScutellÓ
Networks 50 (1), 50-54, 2007
A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
A Frangioni, E Necciari, MG ScutellÓ
Journal of Combinatorial Optimization 8 (2), 195-220, 2004
Pattern-based decompositions for human resource planning in home health care services
S Yalšındağ, P Cappanera, MG ScutellÓ, E Şahin, A Matta
Computers & Operations Research 73, 12-26, 2016
A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
D Ambrosino, A Sciomachen, MG ScutellÓ
Computers & Operations Research 36 (2), 442-460, 2009
A new algorithm for reoptimizing shortest paths when the arc costs change
S Pallottino, MG ScutellÓ
Operations Research Letters 31 (2), 149-160, 2003
A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
MG Scutella
The Journal of Logic Programming 8 (3), 265-273, 1990
Polynomially solvable satisfiability problems
G Gallo, MG ScutellÓ
Information Processing Letters 29 (5), 221-227, 1988
Robust portfolio asset allocation and risk measures
MG Scutella, R Recchia
Annals of Operations Research 204 (1), 145-169, 2013
Flows on hypergraphs
R Cambini, G Gallo, MG ScutellÓ
Mathematical programming 78 (2), 195-217, 1997
Large‐scale local search heuristics for the capacitated vertex p‐center problem
MP Scaparra, S Pallottino, MG ScutellÓ
Networks: An International Journal 43 (4), 241-255, 2004
Directed hypergraphs as a modelling paradigm
G Gallo, MG Scutella
Decisions in Economics and Finance 21 (1), 97-123, 1998
A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
B Gendron, MG ScutellÓ, RG Garroppo, G Nencioni, L Tavanti
European Journal of Operational Research 255 (1), 151-162, 2016
Minimum time and minimum cost-path problems in street networks with periodic traffic lights
RK Ahuja, JB Orlin, S Pallottino, MG ScutellÓ
Transportation Science 36 (3), 326-336, 2002
Polynomial auction algorithms for shortest paths
DP Bertsekas, S Pallottino, MG ScutellÓ
Computational Optimization and Applications 4 (2), 99-125, 1995
Il sistema al momento non pu˛ eseguire l'operazione. Riprova pi¨ tardi.
Articoli 1–20