default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicola Bianchessi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Ali Diabat, Nicola Bianchessi
, Claudia Archetti:
On the zero-inventory-ordering policy in the inventory routing problem. Eur. J. Oper. Res. 312(3): 1024-1038 (2024)- [j27]Nicola Bianchessi, Timo Gschwind, Stefan Irnich:
Resource-Window Reduction by Reduced Costs in Path-Based Formulations for Routing and Scheduling Problems. INFORMS J. Comput. 36(1): 224-244 (2024) - 2023
- [j26]Nicola Bianchessi:
On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: A branch-and-cut algorithm. Networks 81(4): 499-513 (2023) - [i1]Michele Barbato, Nicola Bianchessi:
On the Complexity of Sub-Tree Scheduling for Wireless Sensor Networks with Partial Coverage. CoRR abs/2301.00739 (2023) - 2022
- [j25]Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis:
The Profitable Close-Enough Arc Routing Problem. Comput. Oper. Res. 140: 105653 (2022) - [j24]Nicola Bianchessi, Ángel Corberán, Isaac Plana, Miguel Reula, José M. Sanchis:
The min-max close-enough arc routing problem. Eur. J. Oper. Res. 300(3): 837-851 (2022) - 2021
- [j23]Nicola Bianchessi, Emanuele Tresoldi:
A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts. Comput. Oper. Res. 136: 105464 (2021) - [j22]Nicola Bianchessi, Stefan Irnich, Christian Tilk:
A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. Discret. Appl. Math. 288: 152-170 (2021) - 2020
- [j21]Christos Orlis, Nicola Bianchessi, Roberto Roberti, Wout Dullaert:
The Team Orienteering Problem with Overlaps: An Application in Cash Logistics. Transp. Sci. 54(2): 470-487 (2020)
2010 – 2019
- 2019
- [j20]Timo Gschwind, Nicola Bianchessi, Stefan Irnich:
Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. Eur. J. Oper. Res. 278(1): 91-104 (2019) - [j19]Nicola Bianchessi, Stefan Irnich:
Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows. Transp. Sci. 53(2): 442-462 (2019) - [j18]Nicola Bianchessi, Michael Drexl, Stefan Irnich:
The Split Delivery Vehicle Routing Problem with Time Windows and Customer Inconvenience Constraints. Transp. Sci. 53(4): 1067-1084 (2019) - 2018
- [j17]Nicola Bianchessi, Renata Mansini, M. Grazia Speranza:
A branch-and-cut algorithm for the Team Orienteering Problem. Int. Trans. Oper. Res. 25(2): 627-635 (2018) - [j16]Christian Tilk, Nicola Bianchessi, Michael Drexl, Stefan Irnich, Frank Meisel:
Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem. Transp. Sci. 52(2): 300-319 (2018) - 2015
- [j15]Claudia Archetti, Nicola Bianchessi, M. Grazia Speranza:
A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem. Comput. Oper. Res. 64: 1-10 (2015) - [j14]Claudia Archetti, Nicola Bianchessi, Alain Hertz, Adrien Colombet, François Gagnon:
Directed weighted improper coloring for cellular channel allocation. Discret. Appl. Math. 182: 46-60 (2015) - 2014
- [j13]Enrico Angelelli, Nicola Bianchessi, Carlo Filippi:
Optimal interval scheduling with a resource constraint. Comput. Oper. Res. 51: 268-281 (2014) - [j12]Claudia Archetti, Nicola Bianchessi, Alain Hertz:
A branch-and-price algorithm for the robust graph coloring problem. Discret. Appl. Math. 165: 49-59 (2014) - [j11]Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza:
The distance constrained multiple vehicle traveling purchaser problem. Eur. J. Oper. Res. 235(1): 73-87 (2014) - [j10]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
Branch-and-cut algorithms for the split delivery vehicle routing problem. Eur. J. Oper. Res. 238(3): 685-698 (2014) - [j9]Claudia Archetti, Nicola Bianchessi, Stefan Irnich, M. Grazia Speranza:
Formulations for an inventory routing problem. Int. Trans. Oper. Res. 21(3): 353-374 (2014) - [j8]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz:
The split delivery capacitated team orienteering problem. Networks 63(1): 16-33 (2014) - [j7]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza, Alain Hertz:
Incomplete service and split deliveries in a routing problem with profits. Networks 63(2): 135-145 (2014) - 2013
- [j6]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
Optimal solutions for routing problems with profits. Discret. Appl. Math. 161(4-5): 547-557 (2013) - [j5]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
The capacitated team orienteering problem with incomplete service. Optim. Lett. 7(7): 1405-1417 (2013) - 2011
- [j4]Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
A column generation approach for the split delivery vehicle routing problem. Networks 58(4): 241-254 (2011) - 2010
- [j3]Enrico Angelelli, Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza:
Comparison of policies in dynamic routing problems. J. Oper. Res. Soc. 61(4): 686-695 (2010)
2000 – 2009
- 2007
- [j2]Nicola Bianchessi, Giovanni Righini:
Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput. Oper. Res. 34(2): 578-594 (2007) - [j1]Nicola Bianchessi, Jean-François Cordeau, Jacques Desrosiers, Gilbert Laporte, Vincent Raymond:
A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites. Eur. J. Oper. Res. 177(2): 750-762 (2007) - 2006
- [b1]Nicola Bianchessi:
Planning and scheduling problems for Earth observation satellites. University of Milan, Italy, 2006
Coauthor Index
aka: M. Grazia Speranza
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-07-05 20:18 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:
