Demetrio Laganà

Orcid: 0000-0003-2618-6715

According to our database1, Demetrio Laganà authored at least 35 papers between 2006 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
An iterated local search matheuristic approach for the multi-vehicle inventory routing problem.
Comput. Oper. Res., 2024

2023
A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs.
Eur. J. Oper. Res., May, 2023

2022
Analysis of effective sets of routes for the split-delivery periodic inventory routing problem.
Eur. J. Oper. Res., 2022

2021
A pick-up and delivery problem for logistics e-marketplace services.
Optim. Lett., 2021

Arc routing under uncertainty: Introduction and literature review.
Comput. Oper. Res., 2021

A dynamic multi-period general routing problem arising in postal service and parcel delivery systems.
Comput. Oper. Res., 2021

2020
The inventory routing problem under uncertainty with perishable products: an application in the agri-food supply chain.
Soft Comput., 2020

Preface: Special issue on arc routing problems and other related topics.
Networks, 2020

An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows.
Oper. Res., 2020

An exact approach for cyclic inbound inventory routing in a level production system.
Eur. J. Oper. Res., 2020

Load Management with Predictions of Solar Energy Production for Cloud Data Centers.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

2019
The risk-averse traveling repairman problem with profits.
Soft Comput., 2019

The periodic rural postman problem with irregular services on mixed graphs.
Eur. J. Oper. Res., 2019

IoT-HC: A Novel IoT Architecture for the Hybrid Cloud.
Proceedings of the 28th International Conference on Computer Communication and Networks, 2019

2018
Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows.
Eur. J. Oper. Res., 2018

Reducing the Operational Cost of Cloud Data Centers through Renewable Energy.
Algorithms, 2018

2017
The Undirected Capacitated General Routing Problem with Profits.
Eur. J. Oper. Res., 2017

Business scenarios for hierarchical workload management in data centers.
Proceedings of the Second International Conference on Internet of things and Cloud Computing, 2017

2016
The constrained shortest path tour problem.
Comput. Oper. Res., 2016

2015
Two-phase branch-and-cut for the mixed capacitated general routing problem.
Eur. J. Oper. Res., 2015

The mixed capacitated general routing problem under uncertainty.
Eur. J. Oper. Res., 2015

A decomposition-based heuristic for the multiple-product inventory-routing problem.
Comput. Oper. Res., 2015

2014
A matheuristic algorithm for the mixed capacitated general routing problem.
Networks, 2014

Operations research in solid waste management: A survey of strategic and tactical issues.
Comput. Oper. Res., 2014

2013
Modeling and solving the mixed capacitated general routing problem.
Optim. Lett., 2013

The Express heuristic for probabilistically constrained integer problems.
J. Heuristics, 2013

Solving the shortest path tour problem.
Eur. J. Oper. Res., 2013

Adaptation of the multi-layer allocation problem for warehouse layout optimization: A case study.
Proceedings of the IEEE 7th International Conference on Intelligent Data Acquisition and Advanced Computing Systems, 2013

2012
An optimization-based heuristic for the Multi-objective Undirected Capacitated Arc Routing Problem.
Comput. Oper. Res., 2012

Operations Research as a Service.
Proceedings of the CLOSER 2012 - Proceedings of the 2nd International Conference on Cloud Computing and Services Science, Porto, Portugal, 18, 2012

2011
A General-purpose and Multi-level Scheduling Approach in Energy Efficient Computing.
Proceedings of the CLOSER 2011, 2011

2010
Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions.
J. Heuristics, 2010

An Approximate <i>epsilon</i>-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2006
Solving simulation optimization problems on grid computing systems.
Parallel Comput., 2006

A constructive heuristic for the Undirected Rural Postman Problem.
Comput. Oper. Res., 2006


  Loading...