default search action
Demetrio Laganà
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j28]Demetrio Laganà
, Enrico Malaguti
An iterated local search matheuristic approach for the multi-vehicle inventory routing problem. Comput. Oper. Res. 169: 106717 (2024) - 2023
- [j27]Enrique Benavent, Ángel Corberán, Demetrio Laganà
A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs. Eur. J. Oper. Res. 307(1): 64-81 (2023) - 2022
- [j26]Luca Bertazzi, Geoffrey A. Chua
Analysis of effective sets of routes for the split-delivery periodic inventory routing problem. Eur. J. Oper. Res. 298(2): 463-477 (2022) - 2021
- [j25]Demetrio Laganà
A dynamic multi-period general routing problem arising in postal service and parcel delivery systems. Comput. Oper. Res. 129: 105195 (2021) - [j24]Annarita De Maio, Demetrio Laganà
Arc routing under uncertainty: Introduction and literature review. Comput. Oper. Res. 135: 105442 (2021) - [j23]Patrizia Beraldi, Annarita De Maio
A pick-up and delivery problem for logistics e-marketplace services. Optim. Lett. 15(5): 1565-1577 (2021) - 2020
- [j22]Luca Bertazzi, Demetrio Laganà
An exact approach for cyclic inbound inventory routing in a level production system. Eur. J. Oper. Res. 283(3): 915-928 (2020) - [j21]Rosario Paradiso
An Exact Solution Framework for Multitrip Vehicle-Routing Problems with Time Windows. Oper. Res. 68(1): 180-198 (2020) - [j20]Ángel Corberán
Preface: Special issue on arc routing problems and other related topics. Networks 76(4): 429-430 (2020) - [j19]Antonio Violi
The inventory routing problem under uncertainty with perishable products: an application in the agri-food supply chain. Soft Comput. 24(18): 13725-13740 (2020) - [c7]Maurizio Floridia, Demetrio Laganà, Carlo Mastroianni, Michela Meo
Load Management with Predictions of Solar Energy Production for Cloud Data Centers. ICASSP 2020: 8986-8990
2010 – 2019
- 2019
- [j18]Enrique Benavent, Ángel Corberán, Demetrio Laganà
The periodic rural postman problem with irregular services on mixed graphs. Eur. J. Oper. Res. 276(3): 826-839 (2019) - [j17]Patrizia Beraldi, Maria Elena Bruni
The risk-averse traveling repairman problem with profits. Soft Comput. 23(9): 2979-2993 (2019) - [c6]Carmine De Napoli, Agostino Forestiero
IoT-HC: A Novel IoT Architecture for the Hybrid Cloud. ICCCN 2019: 1-6 - 2018
- [j16]Demetrio Laganà, Carlo Mastroianni, Michela Meo
Reducing the Operational Cost of Cloud Data Centers through Renewable Energy. Algorithms 11(10): 145 (2018) - [j15]Claudio Ciancio, Demetrio Laganà
Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows. Eur. J. Oper. Res. 267(1): 187-199 (2018) - 2017
- [j14]Claudia Archetti
The Undirected Capacitated General Routing Problem with Profits. Eur. J. Oper. Res. 257(3): 822-833 (2017) - [c5]Alfredo Cuzzocrea, Carmine De Napoli, Agostino Forestiero
Business scenarios for hierarchical workload management in data centers. ICC 2017: 182:1-182:7 - 2016
- [j13]Daniele Ferone
The constrained shortest path tour problem. Comput. Oper. Res. 74: 64-77 (2016) - 2015
- [j12]Jean-François Cordeau
A decomposition-based heuristic for the multiple-product inventory-routing problem. Comput. Oper. Res. 55: 153-166 (2015) - [j11]Patrizia Beraldi
The mixed capacitated general routing problem under uncertainty. Eur. J. Oper. Res. 240(2): 382-392 (2015) - [j10]Stefan Irnich
Two-phase branch-and-cut for the mixed capacitated general routing problem. Eur. J. Oper. Res. 243(1): 17-29 (2015) - 2014
- [j9]Gianpaolo Ghiani
Operations research in solid waste management: A survey of strategic and tactical issues. Comput. Oper. Res. 44: 22-32 (2014) - [j8]Adamo Bosco, Demetrio Laganà
A matheuristic algorithm for the mixed capacitated general routing problem. Networks 64(4): 262-281 (2014) - 2013
- [j7]Paola Festa, Francesca Guerriero
Solving the shortest path tour problem. Eur. J. Oper. Res. 230(3): 464-474 (2013) - [j6]Maria Elena Bruni
The Express heuristic for probabilistically constrained integer problems. J. Heuristics 19(3): 423-441 (2013) - [j5]Adamo Bosco, Demetrio Laganà
Modeling and solving the mixed capacitated general routing problem. Optim. Lett. 7(7): 1451-1469 (2013) - [c4]Giovanni Mirabelli, Teresa Pizzuti, Demetrio Laganà
Adaptation of the multi-layer allocation problem for warehouse layout optimization: A case study. IDAACS 2013: 167-172 - 2012
- [j4]Lucio Grandinetti, Francesca Guerriero
An optimization-based heuristic for the Multi-objective Undirected Capacitated Arc Routing Problem. Comput. Oper. Res. 39(10): 2300-2309 (2012) - [c3]Mehdi Sheikhalishahi, Demetrio Laganà, Lucio Grandinetti:
Operations Research as a Service. CLOSER 2012: 480-483 - 2011
- [c2]Mehdi Sheikhalishahi, Manoj H. Devare, Lucio Grandinetti, Demetrio Laganà:
A General-purpose and Multi-level Scheduling Approach in Energy Efficient Computing. CLOSER 2011: 37-42 - 2010
- [j3]Gianpaolo Ghiani
Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions. J. Heuristics 16(2): 211-233 (2010) - [c1]Lucio Grandinetti, Francesca Guerriero
An Approximate epsilon-Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem. SEA 2010: 214-225
2000 – 2009
- 2006
- [j2]Gianpaolo Ghiani
A constructive heuristic for the Undirected Rural Postman Problem. Comput. Oper. Res. 33(12): 3450-3457 (2006) - [j1]Demetrio Laganà
Solving simulation optimization problems on grid computing systems. Parallel Comput. 32(9): 688-700 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: