Maria Grazia Scutellà

According to our database1, Maria Grazia Scutellà authored at least 45 papers between 1988 and 2018.

Collaborative distances:



In proceedings 
PhD thesis 




Green Design of Wireless Local Area Networks by Multiband Robust Optimization.
Electronic Notes in Discrete Mathematics, 2018

Power savings with data rate guarantee in dense WLANs.
Proceedings of the International Conference on Selected Topics in Mobile and Wireless Networking, 2017

A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks.
European Journal of Operational Research, 2016

Robust optimisation of green wireless LANs under rate uncertainty and user mobility.
Electronic Notes in Discrete Mathematics, 2016

Pattern-based decompositions for human resource planning in home health care services.
Computers & OR, 2016

Joint Assignment, Scheduling, and Routing Models to Home Care Optimization: A Pattern-Based Approach.
Transportation Science, 2015

Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models.
J. Optimization Theory and Applications, 2015

Power-Aware Routing and Network Design with Bundled Links: Solutions and Analysis.
Journal Comp. Netw. and Communic., 2013

Does Traffic Consolidation Always Lead to Network Energy Savings?
IEEE Communications Letters, 2013

Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks.
Electronic Notes in Discrete Mathematics, 2013

Home Care optimization: impact of pattern generation policies on scheduling and routing decisions.
Electronic Notes in Discrete Mathematics, 2013

Models and valid inequalities to asymmetric skill-based routing problems.
EURO J. Transportation and Logistics, 2013

Mixed Integer Non-Linear Programming models for Green Network Design.
Computers & OR, 2013

Robust portfolio asset allocation and risk measures.
Annals OR, 2013

Networks, 2012

Energy saving heuristics in backbone networks.
Proceedings of the Sustainable Internet and ICT for Sustainability, 2012

Static and dynamic routing under disjoint dominant extreme demands.
Oper. Res. Lett., 2011

Color-Coding Algorithms to the Balanced Path Problem: Computational Issues.
INFORMS Journal on Computing, 2011

Linear programming models for traffic engineering in 100% survivable networks under combined IS-IS/OSPF and MPLS-TE.
Computers & OR, 2011

The Skill Vehicle Routing Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

Network Power Management: Models and Heuristic Approaches.
Proceedings of the Global Communications Conference, 2011

Robust portfolio asset allocation and risk measures.
4OR, 2010

On improving optimal oblivious routing.
Oper. Res. Lett., 2009

A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem.
Computers & OR, 2009

The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case.
Networks, 2008

Networks, 2008

Hardness of robust network design.
Networks, 2007

A note on the parametric maximum flow problem and some related reoptimization issues.
Annals OR, 2007

Balanced paths in acyclic networks: Tractable cases and related approaches.
Networks, 2005

Distribution network design: New problems and related models.
European Journal of Operational Research, 2005

Large-scale local search heuristics for the capacitated vertex p-center problem.
Networks, 2004

A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem.
Management Science, 2004

A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems.
J. Comb. Optim., 2004

A new algorithm for reoptimizing shortest paths when the arc costs change.
Oper. Res. Lett., 2003

Dynamic shortest paths minimizing travel times and costs.
Networks, 2003

An approximation algorithm for computing longest paths.
European Journal of Operational Research, 2003

Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights.
Transportation Science, 2002

A note on minimum makespan assembly plans.
European Journal of Operational Research, 2002

A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem.
Discrete Applied Mathematics, 1998

Dual algorithms for the shortest path tree problem.
Networks, 1997

Flows on hypergraphs.
Math. Program., 1997

Polynomial auction algorithms for shortest paths.
Comp. Opt. and Appl., 1995

Toward a Programming Environment for Combinatorial Optimization: A Case Study Oriented to Max-Flow Computations.
INFORMS Journal on Computing, 1993

A Note on Dowling and Gallier's Top-Down Algorithm for Propositional Horn Satisfiability.
J. Log. Program., 1990

Polynomially Solvable Satisfiability Problems.
Inf. Process. Lett., 1988