default search action
Antonino Sgalambro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Francesco Ciardiello, Andrea Genovese
, Shucheng Luo, Antonino Sgalambro
A game-theoretic multi-stakeholder model for cost allocation in urban consolidation centres. Ann. Oper. Res. 324(1): 663-686 (2023) - [j13]Serena Fugaro
Advanced network connectivity features and zonal requirements in Covering Location problems. Comput. Oper. Res. 159: 106307 (2023) - [j12]Donatella Granata
A hybrid modified-NSGA-II VNS algorithm for the Multi-Objective Critical Disruption Path Problem. Comput. Oper. Res. 160: 106363 (2023) - 2020
- [j11]Anna Melchiori
A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem. Eur. J. Oper. Res. 282(3): 846-857 (2020) - [j10]Elena Fernández, Antonino Sgalambro
On carriers collaboration in hub location problems. Eur. J. Oper. Res. 283(2): 476-490 (2020)
2010 – 2019
- 2018
- [j9]Anna Melchiori, Antonino Sgalambro
A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem. Comput. Oper. Res. 92: 111-129 (2018) - 2016
- [j8]Donatella Granata, Antonino Sgalambro
Network Interdiction through Length-Bounded Critical Disruption Paths: a Bi-Objective Approach. Electron. Notes Discret. Math. 52: 375-382 (2016) - 2014
- [j7]Teodor Gabriel Crainic
Service network design models for two-tier city logistics. Optim. Lett. 8(4): 1375-1387 (2014) - 2012
- [j6]Giuseppe Bruno, Andrea Genovese
An extension of the schedule optimization problem at a public transit terminal to the multiple destinations case. Public Transp. 3(3): 189-198 (2012) - 2011
- [c1]Paolo Dell'Olmo, Antonino Sgalambro
The Spatially Equitable Multicommodity Capacitated Network Flow Problem. INOC 2011: 196-209 - 2010
- [j5]Massimiliano Caramia
Fluidsim: A Car Traffic Simulation Prototype Based on FluidDynamic. Algorithms 3(3): 294-310 (2010) - [j4]Massimiliano Caramia
A fast heuristic algorithm for the maximum concurrent k-splittable flow problem. Optim. Lett. 4(1): 37-55 (2010)
2000 – 2009
- 2009
- [j3]Giuseppe Bruno, Gennaro Improta, Antonino Sgalambro
Models for the schedule optimization problem at a public transit terminal. OR Spectr. 31(3): 465-481 (2009) - 2008
- [j2]Massimiliano Caramia
On the approximation of the single source k-splittable flow problem. J. Discrete Algorithms 6(2): 277-289 (2008) - [j1]Massimiliano Caramia
An exact approach for the maximum concurrent k -splittable flow problem. Optim. Lett. 2(2): 251-265 (2008)
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-30 21:34 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: