Maria Grazia Scutellà

Andrea Matta

Martino Singuaroli

Eur. J. Oper. Res., 2024

2023

Design model of an IEEE 802.11ad infrastructure for TSN-based industrial applications.

[BibT_eX]

[DOI]

Comput. Networks, July, 2023

2022

The Green Sequencing and Routing Problem.

[BibT_eX]

[DOI]

Giacomo Lanza

Mauro Passacantando

Proceedings of the Computational Logistics - 13th International Conference, 2022

2021

Optimal Access Point Power Management for Green IEEE 802.11 Networks.

[BibT_eX]

[DOI]

Sensors, 2021

The Last-Mile Delivery Process with Trucks and Drones Under Uncertain Energy Consumption.

[BibT_eX]

[DOI]

Luigi Di Puglia Pugliese

Francesca Guerriero

J. Optim. Theory Appl., 2021

2020

Robust green Wireless Local Area Networks: A matheuristic approach.

[BibT_eX]

[DOI]

Fabio D'Andreagiovanni

J. Netw. Comput. Appl., 2020

Temporal constraints and device management for the Skill VRP: Mathematical model and lower bounding techniques.

[BibT_eX]

[DOI]

Cristina Requejo

Comput. Oper. Res., 2020

Increasing the reliability of IEEE 802.11ad for industrial applications.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, 2020

Energy-efficient resource allocation in wireless LANs under non-linear capacity constraints.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, 2020

2019

I-READ 4.0: Internet-of-READers for an efficient asset management in large warehouses with high stock rotation index.

[BibT_eX]

[DOI]

Proceedings of the 5th IEEE International forum on Research and Technology for Society and Industry, 2019

2018

Green Design of Wireless Local Area Networks by Multiband Robust Optimization.

[BibT_eX]

[DOI]

Fabio D'Andreagiovanni

Electron. Notes Discret. Math., 2018

2017

Power savings with data rate guarantee in dense WLANs.

[BibT_eX]

[DOI]

Fabio D'Andreagiovanni

Proceedings of the International Conference on Selected Topics in Mobile and Wireless Networking, 2017

2016

A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

Robust optimisation of green wireless LANs under rate uncertainty and user mobility.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

Pattern-based decompositions for human resource planning in home health care services.

[BibT_eX]

[DOI]

Semih Yalçindag

Evren Sahin

Andrea Matta

Comput. Oper. Res., 2016

2015

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

[BibT_eX]

[DOI]

Transp. Sci., 2015

Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models.

[BibT_eX]

[DOI]

Antonio Frangioni

Laura Galli

J. Optim. Theory Appl., 2015

2013

Power-Aware Routing and Network Design with Bundled Links: Solutions and Analysis.

[BibT_eX]

[DOI]

J. Comput. Networks Commun., 2013

Does Traffic Consolidation Always Lead to Network Energy Savings?

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2013

Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Home Care optimization: impact of pattern generation policies on scheduling and routing decisions.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Models and valid inequalities to asymmetric skill-based routing problems.

[BibT_eX]

[DOI]

Luis Eduardo Neves Gouveia

EURO J. Transp. Logist., 2013

Mixed Integer Non-Linear Programming models for Green Network Design.

[BibT_eX]

[DOI]

Luis Eduardo Neves Gouveia

Comput. Oper. Res., 2013

2012

Editorial.

[BibT_eX]

[DOI]

Networks, 2012

Energy saving heuristics in backbone networks.

[BibT_eX]

[DOI]

Michele Pagano

Proceedings of the Sustainable Internet and ICT for Sustainability, 2012

2011

Static and dynamic routing under disjoint dominant extreme demands.

[BibT_eX]

[DOI]

Antonio Frangioni

F. Pascali

Oper. Res. Lett., 2011

Color-Coding Algorithms to the Balanced Path Problem: Computational Issues.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2011

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

[BibT_eX]

[DOI]

Paola Zuddas

Comput. Oper. Res., 2011

The Skill Vehicle Routing Problem.

[BibT_eX]

[DOI]

Luis Eduardo Neves Gouveia

Proceedings of the Network Optimization - 5th International Conference, 2011

Network Power Management: Models and Heuristic Approaches.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2011

2010

Robust portfolio asset allocation and risk measures.

[BibT_eX]

[DOI]

Raffaella Recchia

4OR, 2010

2009

On improving optimal oblivious routing.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2009

A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem.

[BibT_eX]

[DOI]

Daniela Ambrosino

Anna Sciomachen

Comput. Oper. Res., 2009

2008

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

[BibT_eX]

[DOI]

Networks, 2008

Foreword.

[BibT_eX]

[DOI]

Networks, 2008

2007

Hardness of robust network design.

[BibT_eX]

[DOI]

Chandra Chekuri

F. Bruce Shepherd

Gianpaolo Oriolo

Networks, 2007

A note on the parametric maximum flow problem and some related reoptimization issues.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2007

2005

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

[BibT_eX]

[DOI]

Networks, 2005

Distribution network design: New problems and related models.

[BibT_eX]

[DOI]

Daniela Ambrosino

Eur. J. Oper. Res., 2005

2004

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

[BibT_eX]

[DOI]

Maria Paola Scaparra

Networks, 2004

A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem.

[BibT_eX]

[DOI]

Manag. Sci., 2004

A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems.

[BibT_eX]

[DOI]

Antonio Frangioni

Emiliano Necciari

J. Comb. Optim., 2004

2003

A new algorithm for reoptimizing shortest paths when the arc costs change.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2003

Dynamic shortest paths minimizing travel times and costs.

[BibT_eX]

[DOI]

Ravindra K. Ahuja

James B. Orlin

Networks, 2003

An approximation algorithm for computing longest paths.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2003

2002

Minimum Time and Minimum Cost-Path Problems in Street Networks with Periodic Traffic Lights.

[BibT_eX]

[DOI]

Ravindra K. Ahuja

James B. Orlin

Transp. Sci., 2002

A note on minimum makespan assembly plans.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

1998

A Strongly Polynomial Algorithm for the Uniform Balanced Network Flow Problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1997

Dual algorithms for the shortest path tree problem.

[BibT_eX]

[DOI]

Networks, 1997

Flows on hypergraphs.

[BibT_eX]

[DOI]

Riccardo Cambini

Math. Program., 1997

1995

Polynomial auction algorithms for shortest paths.

[BibT_eX]

[DOI]

Dimitri P. Bertsekas

Comput. Optim. Appl., 1995

1993

Toward a Programming Environment for Combinatorial Optimization: A Case Study Oriented to Max-Flow Computations.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1993

1990

A Note on Dowling and Gallier's Top-Down Algorithm for Propositional Horn Satisfiability.

[BibT_eX]

[DOI]

J. Log. Program., 1990

1988

Polynomially Solvable Satisfiability Problems.

[BibT_eX]

[DOI]