default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonio Sforza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j24]Annunziata Esposito Amideo
, Maria Paola Scaparra, Antonio Sforza, Claudio Sterle:
An integrated user-system approach for shelter location and evacuation routing. Networks 78(1): 46-68 (2021)- 2020
- [j23]Claudia Archetti, M. Grazia Speranza, Maurizio Boccia, Antonio Sforza, Claudio Sterle:
A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries. Eur. J. Oper. Res. 282(3): 886-895 (2020) - [j22]Maurizio Boccia, Antonio Sforza, Claudio Sterle:
Simple Pattern Minimality Problems: Integer Linear Programming Formulations and Covering-Based Heuristic Solving Approaches. INFORMS J. Comput. 32(4): 1049-1060 (2020) - [j21]Mauro Russo, Maurizio Boccia, Antonio Sforza, Claudio Sterle:
Constrained two-dimensional guillotine cutting problem: upper-bound review and categorization. Int. Trans. Oper. Res. 27(2): 794-834 (2020) - [c5]Maurizio Boccia, Adriano Masone, Antonio Sforza, Claudio Sterle:
Optimal Location of Welds on the Vehicle Wiring Harness: P-Median Based Exact and Heuristic Approaches. MOTOR 2020: 315-328
2010 – 2019
- 2019
- [j20]Raffaele Cerulli, Antonio Sforza, Daniele Vigo:
Preface: Special issue on network optimization in transportation, logistics, and industry. Networks 74(2): 109-110 (2019) - [j19]Maria Elena Nenni, Antonio Sforza, Claudio Sterle:
Sustainability-based review of urban freight models. Soft Comput. 23(9): 2899-2909 (2019) - [j18]Adriano Masone, Maria Elena Nenni, Antonio Sforza, Claudio Sterle:
The Minimum Routing Cost Tree Problem - State of the art and a core-node based heuristic algorithm. Soft Comput. 23(9): 2947-2957 (2019) - [j17]Igor Vasilyev, Anton V. Ushakov, Nadezhda Maltugueva, Antonio Sforza:
An effective heuristic for large-scale fault-tolerant k-median problem. Soft Comput. 23(9): 2959-2967 (2019) - 2018
- [j16]Maurizio Boccia, Teodor Gabriel Crainic, Antonio Sforza, Claudio Sterle:
Multi-commodity location-routing: Flow intercepting formulation and branch-and-cut algorithm. Comput. Oper. Res. 89: 94-112 (2018) - 2016
- [j15]Claudio Sterle, Antonio Sforza, Annunziata Esposito Amideo, Carmela Piccolo:
A unified solving approach for two and three dimensional coverage problems in sensor networks. Optim. Lett. 10(5): 1101-1123 (2016) - [c4]Francesca De Cillis, Stefano De Muro, Franco Fiumara, Roberto Setola, Antonio Sforza, Claudio Sterle:
Railway Station Surveillance System Design: A Real Application of an Optimal Coverage Approach. CRITIS 2016: 63-74 - 2015
- [c3]Jaime Llorca, Claudio Sterle, Antonia M. Tulino, Nakjung Choi, Antonio Sforza, Annunziata Esposito Amideo:
Joint content-resource allocation in software defined virtual CDNs. ICC Workshops 2015: 1839-1844 - 2014
- [j14]Mauro Russo, Antonio Sforza, Claudio Sterle:
An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems. Comput. Oper. Res. 50: 97-114 (2014) - 2013
- [j13]Francesca De Cillis, Antonio Sforza, Claudio Sterle:
Optimal location of flow intercepting facilities to improve security in urban areas. Int. J. Syst. Syst. Eng. 4(3/4): 222-242 (2013) - [c2]Antonio Sforza, Claudio Sterle, Pasquale D'Amore, Annarita Tedesco, Francesca De Cillis, Roberto Setola:
Optimization Models in a Smart Tool for the Railway Infrastructure Protection. CRITIS 2013: 191-196 - 2011
- [j12]Maurizio Boccia, Serena di Muro, Francesco Mosca, Antonio Sforza, Claudio Sterle:
A fast heuristic for a three-dimensional non-convex domain loading problem. 4OR 9(1): 83-101 (2011) - 2010
- [c1]Maurizio Boccia, Teodor Gabriel Crainic, Antonio Sforza, Claudio Sterle:
A Metaheuristic for a Two Echelon Location-Routing Problem. SEA 2010: 288-301
2000 – 2009
- 2009
- [j11]Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev:
An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15(6): 597-615 (2009) - [j10]Maurizio Boccia, Antonio Sforza, Claudio Sterle:
Flow Intercepting Facility Location: Problems, Models and Heuristics. J. Math. Model. Algorithms 8(1): 35-79 (2009) - 2008
- [j9]Maurizio Boccia, Antonio Sforza, Claudio Sterle, Igor Vasil'ev:
A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes. J. Math. Model. Algorithms 7(1): 43-58 (2008) - 2007
- [j8]Fabrizio Marinelli, Maria Elena Nenni, Antonio Sforza:
Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company. Ann. Oper. Res. 150(1): 177-192 (2007) - 2005
- [j7]Pasquale Avella, Maurizio Boccia, Carmine Di Martino, Giuseppe Oliviero, Antonio Sforza, Igor Vasil'ev:
A decomposition approach for a very large scale optimal diversity management problem. 4OR 3(1): 23-37 (2005) - [j6]Pasquale Avella, Maurizio Boccia, Antonio Sforza, Igor Vasil'ev:
A Branch-and-Cut Algorithm for the Median-Path Problem. Comput. Optim. Appl. 32(3): 215-230 (2005) - [j5]Pasquale Avella, Domenico Villacci, Antonio Sforza:
A Steiner arborescence model for the feeder reconfiguration in electric distribution networks. Eur. J. Oper. Res. 164(2): 505-509 (2005) - 2004
- [j4]Pasquale Avella, Maurizio Boccia, Antonio Sforza:
Solving a fuel delivery problem by heuristic and exact approaches. Eur. J. Oper. Res. 152(1): 170-179 (2004) - [j3]Pasquale Avella, Maurizio Boccia, Antonio Sforza:
Resource Constrained Shortest Path Problems in Path Planning for Fleet Management. J. Math. Model. Algorithms 3(1): 1-17 (2004) - 2002
- [j2]Pasquale Avella, Maurizio Boccia, Antonio Sforza:
A penalty function heuristic for the resource constrained shortest path problem. Eur. J. Oper. Res. 142(2): 221-230 (2002)
1990 – 1999
- 1999
- [j1]Pasquale Avella, Antonio Sforza:
Logical reduction tests for the p-problem. Ann. Oper. Res. 86: 105-115 (1999)
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 2025-01-09 13:08 CET 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:
