default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca Bertazzi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j43]Alessandro Barba, Luca Bertazzi, Bruce L. Golden
:
Competitive Analysis of Algorithms for an Online Distribution Problem. Algorithms 17(6): 237 (2024)- [j42]Shuhan Kou, Bruce L. Golden, Luca Bertazzi:
Estimating optimal split delivery vehicle routing problem solution values. Comput. Oper. Res. 168: 106714 (2024) - [j41]Luca Bertazzi, Riccardo Mogre, Nikolaos Trichakis:
Dynamic Project Expediting: A Stochastic Shortest-Path Approach. Manag. Sci. 70(6): 3748-3768 (2024) - [j40]Shuhan Kou, Bruce L. Golden, Luca Bertazzi:
An improved model for estimating optimal VRP solution values. Optim. Lett. 18(3): 697-703 (2024) - 2023
- [j39]Nho Minh Dinh, Claudia Archetti, Luca Bertazzi:
The inventory routing problem with split deliveries. Networks 82(4): 400-413 (2023) - 2022
- [j38]Luca Bertazzi, Geoffrey A. Chua, Demetrio Laganà, Rosario Paradiso:
Analysis of effective sets of routes for the split-delivery periodic inventory routing problem. Eur. J. Oper. Res. 298(2): 463-477 (2022) - [j37]Rossana Cavagnini, Luca Bertazzi, Francesca Maggioni:
A rolling horizon approach for a multi-stage stochastic fixed-charge transportation problem with transshipment. Eur. J. Oper. Res. 301(3): 912-922 (2022) - [j36]Luca Bertazzi, Xingyin Wang:
Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem. Networks 80(4): 482-501 (2022) - 2021
- [j35]Andrea Bacchetti, Luca Bertazzi, Massimo Zanardini:
Optimizing the distribution planning process in supply chains with distribution strategy choice. J. Oper. Res. Soc. 72(7): 1525-1538 (2021) - [j34]Claudia Archetti, Luca Bertazzi:
Recent challenges in Routing and Inventory Routing: E-commerce and last-mile delivery. Networks 77(2): 255-268 (2021) - [j33]Luca Bertazzi, Jeffrey W. Ohlmann:
Direct k-routing versus cross-docking: worst-case results. Optim. Lett. 15(5): 1579-1586 (2021) - 2020
- [j32]Luca Bertazzi, Demetrio Laganà, Jeffrey W. Ohlmann, Rosario Paradiso:
An exact approach for cyclic inbound inventory routing in a level production system. Eur. J. Oper. Res. 283(3): 915-928 (2020) - [j31]Luca Bertazzi, Nicola Secomandi:
Technical Note - Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands. Oper. Res. 68(3): 671-675 (2020)
2010 – 2019
- 2019
- [j30]Francesca Maggioni, Matteo Cagnolari, Luca Bertazzi:
The value of the right distribution in stochastic programming with application to a Newsvendor problem. Comput. Manag. Sci. 16(4): 739-758 (2019) - [j29]Luca Bertazzi, Bruce L. Golden, Xingyin Wang:
The Bin Packing Problem with Item Fragmentation: A worst-case analysis. Discret. Appl. Math. 261: 63-77 (2019) - [j28]Francesca Maggioni, Matteo Cagnolari, Luca Bertazzi, Stein W. Wallace:
Stochastic optimization models for a bike-sharing problem with transshipment. Eur. J. Oper. Res. 276(1): 272-283 (2019) - 2018
- [j27]Claudia Archetti, Luca Bertazzi, Martin Milanic, David Schindl, Sacha Varone:
Preface: Special Issue on the Ninth International Colloquium on Graphs and Optimization (GO IX), 2014. Discret. Appl. Math. 234: 1-2 (2018) - [j26]Luca Bertazzi, Riccardo Mogre:
Dynamic expediting of an urgent order with uncertain progress. Eur. J. Oper. Res. 267(1): 78-85 (2018) - [j25]Luca Bertazzi, Francesca Maggioni:
A stochastic multi-stage fixed charge transportation problem: Worst-case analysis of the rolling horizon approach. Eur. J. Oper. Res. 267(2): 555-569 (2018) - [j24]Luca Bertazzi, Nicola Secomandi:
Faster rollout search for the vehicle routing problem with stochastic demands and restocking. Eur. J. Oper. Res. 270(2): 487-497 (2018) - 2017
- [j23]Claudia Archetti, Luca Bertazzi, Demetrio Laganà, Francesca Vocaturo:
The Undirected Capacitated General Routing Problem with Profits. Eur. J. Oper. Res. 257(3): 822-833 (2017) - 2015
- [j22]Luca Bertazzi, Bruce L. Golden, Xingyin Wang:
Min-Max vs. Min-Sum Vehicle Routing: A worst-case analysis. Eur. J. Oper. Res. 240(2): 372-381 (2015) - [j21]Luca Bertazzi, Francesca Maggioni:
Solution Approaches for the Stochastic Capacitated Traveling Salesmen Location Problem with Recourse. J. Optim. Theory Appl. 166(1): 321-342 (2015) - 2014
- [j20]Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza:
Polynomial cases of the economic lot sizing problem with cost discounts. Eur. J. Oper. Res. 237(2): 519-527 (2014) - [j19]Luca Bertazzi, Lap Mui Ann Chan:
Analysis of the Best Double Frequency Policy in the Single Link Problem with Discrete Shipping Times. J. Optim. Theory Appl. 163(1): 286-309 (2014) - [c1]Luca Bertazzi, Jeffrey W. Ohlmann:
Determining Transportation Mode Choice To Minimize Distribution Cost: Direct Shipping, Transit Point And 2-Routing. ECMS 2014: 448-453 - 2013
- [j18]Luca Bertazzi, Simona S. M. Cherubini:
An inventory-transportation system with stochastic demand. Comput. Manag. Sci. 10(1): 1-20 (2013) - [j17]Luca Bertazzi, M. Grazia Speranza:
Inventory routing problems with multiple customers. EURO J. Transp. Logist. 2(3): 255-275 (2013) - 2012
- [j16]Luca Bertazzi, M. Grazia Speranza:
Inventory routing problems: an introduction. EURO J. Transp. Logist. 1(4): 307-326 (2012) - [j15]Claudia Archetti, Luca Bertazzi, Alain Hertz, Maria Grazia Speranza:
A Hybrid Heuristic for an Inventory Routing Problem. INFORMS J. Comput. 24(1): 101-116 (2012) - [j14]Luca Bertazzi, O. Zappa:
Integrating transportation and production: an international study case. J. Oper. Res. Soc. 63(7): 920-930 (2012) - [j13]Luca Bertazzi:
Minimum and Worst-Case Performance Ratios of Rollout Algorithms. J. Optim. Theory Appl. 152(2): 378-393 (2012) - 2011
- [j12]Claudia Archetti, Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
Analysis of the maximum level policy in a production-distribution system. Comput. Oper. Res. 38(12): 1731-1746 (2011) - 2010
- [j11]Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza:
Reoptimizing the 0-1 knapsack problem. Discret. Appl. Math. 158(17): 1879-1887 (2010)
2000 – 2009
- 2009
- [j10]Francesca Maggioni, Michal Kaut, Luca Bertazzi:
Stochastic optimization models for a single-sink transportation problem. Comput. Manag. Sci. 6(2): 251-267 (2009) - 2008
- [j9]Luca Bertazzi:
Analysis of Direct Shipping Policies in an Inventory-Routing Problem with Discrete Shipping Times. Manag. Sci. 54(4): 748-762 (2008) - 2007
- [j8]Claudia Archetti, Luca Bertazzi, Gilbert Laporte, Maria Grazia Speranza:
A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. Transp. Sci. 41(3): 382-391 (2007) - 2005
- [j7]Luca Bertazzi, Maria Grazia Speranza:
Improved rounding procedures for the discrete version of the capacitated EOQ problem. Eur. J. Oper. Res. 166(1): 25-34 (2005) - [j6]Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
Minimizing the Total Cost in an Integrated Vendor - Managed Inventory System. J. Heuristics 11(5-6): 393-419 (2005) - 2004
- [j5]Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
An improved heuristic for the period traveling salesman problem. Comput. Oper. Res. 31(8): 1215-1222 (2004) - 2003
- [j4]Claudia Archetti, Luca Bertazzi, Maria Grazia Speranza:
Reoptimizing the traveling salesman problem. Networks 42(3): 154-159 (2003) - 2002
- [j3]Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
Deterministic Order-Up-To Level Policies in an Inventory Routing Problem. Transp. Sci. 36(1): 119-132 (2002) - [j2]Luca Bertazzi, Maria Grazia Speranza:
Continuous and Discrete Shipping Strategies for the Single Link Problem. Transp. Sci. 36(3): 314-325 (2002) - 2001
- [j1]Luca Bertazzi, Maria Grazia Speranza:
Rounding Procedures for the Discrete Version of the Capacitated Economic Order Quantity Problem. Ann. Oper. Res. 107(1-4): 33-49 (2001)
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-08-03 21:17 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:
