default search action
Marco Casazza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j11]Marco Casazza
, Alberto Ceselli
Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks. INFORMS J. Comput. 34(4): 1987-2002 (2022) - 2021
- [j10]Marco Casazza, Alberto Ceselli
Optimization algorithms for resilient path selection in networks. Comput. Oper. Res. 128: 105191 (2021) - [j9]Marco Casazza
A route decomposition approach for the single commodity Split Pickup and Split Delivery Vehicle Routing Problem. Eur. J. Oper. Res. 289(3): 897-911 (2021) - 2020
- [p1]Andrzej Kamisinski, Francesco Musumeci, Ali Hmaity, Massimo Tornatore, Marco Casazza, Stefano Secci, Arsham Farshad
Resilient NFV Technology and Solutions. Guide to Disaster-Resilient Communication Networks 2020: 675-697
2010 – 2019
- 2019
- [j8]Marco Casazza
Availability-driven NFV orchestration. Comput. Networks 155: 47-61 (2019) - [j7]Marco Casazza
New formulations for Variable Cost and Size Bin Packing Problems with Item Fragmentation. Optim. Lett. 13(2): 379-398 (2019) - 2018
- [j6]Marco Casazza
A branch and price approach for the Split Pickup and Split Delivery VRP. Electron. Notes Discret. Math. 69: 189-196 (2018) - [j5]Marco Casazza
The multiple vehicle balancing problem. Networks 72(3): 337-357 (2018) - 2017
- [c3]Marco Casazza
Securing virtual network function placement with high availability guarantees. Networking 2017: 1-9 - [i1]Marco Casazza, Pierre Fouilhoux, Mathieu Bouet, Stefano Secci:
Securing Virtual Network Function Placement with High Availability Guarantees. CoRR abs/1701.07993 (2017) - 2016
- [b1]Marco Casazza:
Algorithms for Optimization Problems with Fractional Resources. (Algorithmes pour des problèmes d'optimisation avec des ressources fractionnaires). Sorbonne Paris Cité, France, 2016 - [j4]Marco Casazza
Exactly solving packing problems with fragmentation. Comput. Oper. Res. 75: 202-213 (2016) - [j3]Marco Casazza
Column generation for the variable cost and size bin packing problem with fragmentation. Electron. Notes Discret. Math. 55: 61-64 (2016) - 2014
- [j2]Marco Casazza
Mathematical programming algorithms for bin packing problems with item fragmentation. Comput. Oper. Res. 46: 1-11 (2014) - [c2]Marco Casazza
Optimizing Time Slot Allocation in Single Operator Home Delivery Problems. OR 2014: 91-97 - 2012
- [j1]Marco Casazza
Efficient algorithms for the double traveling salesman problem with multiple stacks. Comput. Oper. Res. 39(5): 1044-1053 (2012)
2000 – 2009
- 2009
- [c1]Marco Casazza, Alberto Ceselli, Marc Nunkesser:
Efficient Algorithms for the Double Traveling Salesman Problem with Multiple Stacks. CTW 2009: 7-10
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-04-25 05:42 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: