default search action
Roberto Baldacci
Person information
- affiliation: University of Bologna, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j63]Farid Kochakkashani
, Vahid Kayvanfar
Innovative Applications of Unsupervised Learning in Uncertainty-Aware Pharmaceutical Supply Chain Planning. IEEE Access 12: 107984-107999 (2024) - [j62]Zhitao Xu
Correction: Frontiers and trends of supply chain optimization in the age of industry 4.0: an operations research perspective. Ann. Oper. Res. 335(1): 639 (2024) - [j61]Zhitao Xu
Frontiers and trends of supply chain optimization in the age of industry 4.0: an operations research perspective. Ann. Oper. Res. 338(2): 1359-1401 (2024) - [j60]Roberto Baldacci
A Numerically Exact Algorithm for the Bin-Packing Problem. INFORMS J. Comput. 36(1): 141-162 (2024) - [j59]Defeng Sun
A Decomposition Method for the Group-Based Quay Crane Scheduling Problem. INFORMS J. Comput. 36(2): 543-570 (2024) - [j58]Shengnan Shu
Incorporating Holding Costs in Continuous-Time Service Network Design: New Model, Relaxation, and Exact Algorithm. Transp. Sci. 58(2): 412-433 (2024) - [j57]Zhenzhen Zhang
Generalized Riskiness Index in Vehicle Routing Under Uncertain Travel Times: Formulations, Properties, and Exact Solution Framework. Transp. Sci. 58(4): 761-780 (2024) - 2023
- [j56]Roberto Baldacci
New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems. Eur. J. Oper. Res. 307(2): 538-553 (2023) - [j55]Baobin Huang
A metaheuristic algorithm for a locomotive routing problem arising in the steel industry. Eur. J. Oper. Res. 308(1): 385-399 (2023) - [j54]Lu Zhen
Territorial design for customers with demand frequency. Eur. J. Oper. Res. 309(1): 82-101 (2023) - [j53]Yiming Liu, Roberto Baldacci
Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows. Eur. J. Oper. Res. 310(1): 133-155 (2023) - [j52]Yiming Liu, Yang Yu
Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows. INFORMS J. Comput. 35(1): 14-30 (2023) - [j51]Jiliu Li
A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries. INFORMS J. Comput. 35(1): 31-49 (2023) - [j50]Qian Hu, Zhenzhen Zhang, Roberto Baldacci
The bus sightseeing problem. Int. Trans. Oper. Res. 30(6): 4026-4060 (2023) - [c3]Md. Al Amin, Roberto Baldacci, Anika Tabassum Promi:
Identification and Prioritization of Lean Supply Chain Management Factors Using Analytical Hierarchy Process. IEEM 2023: 431-436 - 2022
- [j49]Liyang Xiao, Lu Zhen, Gilbert Laporte, Roberto Baldacci
A column generation-based heuristic for a rehabilitation patient scheduling and routing problem. Comput. Oper. Res. 148: 105970 (2022) - [j48]Lu Zhen, Roberto Baldacci
Scheduling heterogeneous delivery tasks on a mixed logistics platform. Eur. J. Oper. Res. 298(2): 680-698 (2022) - [j47]Alessandro Hill
Optimal Steiner trees under node and edge privacy conflicts. J. Comb. Optim. 43(5): 1509-1533 (2022) - [j46]Roberto Baldacci
Robustness of solutions to the capacitated facility location problem with uncertain demand. Optim. Lett. 16(9): 2711-2727 (2022) - [j45]Kai Wang
Routing Optimization with Generalized Consistency Requirements. Transp. Sci. 56(1): 223-244 (2022) - 2021
- [j44]Defeng Sun
An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability. Eur. J. Oper. Res. 291(1): 271-283 (2021) - [j43]Zhenzhen Zhang
A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy. Transp. Sci. 55(1): 160-178 (2021) - 2020
- [j42]Lijun Wei
A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems. INFORMS J. Comput. 32(2): 428-443 (2020) - [j41]Roberto Baldacci
Optimal Solution of Vehicle Routing Problems with Fractional Objective Function. Transp. Sci. 54(2): 434-452 (2020)
2010 – 2019
- 2019
- [j40]Ulrich Breunig
The electric two-echelon vehicle routing problem. Comput. Oper. Res. 103: 198-210 (2019) - [j39]Defeng Sun
A Benders decomposition-based framework for solving quay crane scheduling problems. Eur. J. Oper. Res. 273(2): 504-515 (2019) - [j38]Yu Zhang
Routing optimization with time windows under uncertainty. Math. Program. 175(1-2): 263-305 (2019) - [j37]Alessandro Hill
Capacitated ring arborescence problems with profits. OR Spectr. 41(2): 357-389 (2019) - [c2]Alessandro Hill
Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts. COCOON 2019: 266-278 - [c1]Fabio Henrique N. Abe, Edna Ayako Hoshino, Alessandro Hill
A Branch-and-Price Algorithm for the Ring-Tree Facility Location Problem. LAGOS 2019: 3-14 - 2018
- [j36]Lin Zhou
A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution. Eur. J. Oper. Res. 265(2): 765-778 (2018) - [j35]Ting Wang, Roberto Baldacci
A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine. Eur. J. Oper. Res. 271(3): 826-838 (2018) - [j34]Roberto Wolfler Calvo
Preface: Emerging challenges in transportation planning. Networks 72(3): 309-310 (2018) - [i2]Ulrich Breunig, Roberto Baldacci, Richard F. Hartl, Thibaut Vidal:
The Electric Two-echelon Vehicle Routing Problem. CoRR abs/1803.03628 (2018) - [i1]Luca Ghezzi, Roberto Baldacci:
A Euclidean Algorithm for Binary Cycles with Minimal Variance. CoRR abs/1804.01207 (2018) - 2017
- [j33]Roberto Baldacci
Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms. Eur. J. Oper. Res. 262(3): 879-893 (2017) - [j32]Roberto Baldacci
The Vehicle Routing Problem with Transhipment Facilities. Transp. Sci. 51(2): 592-606 (2017) - 2014
- [j31]Roberto Baldacci
Algorithms for nesting with defects. Discret. Appl. Math. 163: 17-33 (2014) - [j30]Christos D. Tarantilis, Roberto Baldacci
Editorial. Networks 64(3): 141-142 (2014) - 2013
- [j29]Roberto Baldacci
An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem. Oper. Res. 61(2): 298-314 (2013) - 2012
- [j28]Roberto Baldacci
Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218(1): 1-6 (2012) - [j27]Roberto Baldacci
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 24(3): 356-371 (2012) - 2011
- [j26]Roberto Baldacci
An Exact Algorithm for the Period Routing Problem. Oper. Res. 59(1): 228-241 (2011) - [j25]Roberto Baldacci
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows. Oper. Res. 59(2): 414-426 (2011) - [j24]Roberto Baldacci
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem. Oper. Res. 59(5): 1269-1283 (2011) - [j23]Roberto Baldacci
An Exact Method for the Capacitated Location-Routing Problem. Oper. Res. 59(5): 1284-1296 (2011) - 2010
- [j22]Roberto Baldacci
Exact algorithms for routing problems under vehicle capacity constraints. Ann. Oper. Res. 175(1): 213-245 (2010) - [j21]Roberto Baldacci
An exact solution framework for a broad class of vehicle routing problems. Comput. Manag. Sci. 7(3): 229-268 (2010) - [j20]Roberto Baldacci
Heuristic algorithms for the multi-depot ring-star problem. Eur. J. Oper. Res. 203(1): 270-281 (2010) - [j19]Roberto Baldacci
Some applications of the generalized vehicle routing problem. J. Oper. Res. Soc. 61(7): 1072-1077 (2010)
2000 – 2009
- 2009
- [j18]Roberto Baldacci
Exact methods for large-scale multi-period financial planning problems. Comput. Manag. Sci. 6(3): 281-306 (2009) - [j17]Roberto Baldacci
A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120(2): 347-380 (2009) - [j16]Roberto Baldacci
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs. Networks 54(4): 178-189 (2009) - 2008
- [j15]Roberto Baldacci
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Program. 115(2): 351-385 (2008) - 2007
- [j14]Roberto Baldacci
Recent advances in vehicle routing exact algorithms. 4OR 5(4): 269-298 (2007) - [j13]Roberto Baldacci
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem. Eur. J. Oper. Res. 183(3): 1136-1149 (2007) - [j12]Roberto Baldacci
The Capacitated m-Ring-Star Problem. Oper. Res. 55(6): 1147-1162 (2007) - 2006
- [j11]Roberto Baldacci
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Comput. Oper. Res. 33: 2667-2702 (2006) - [j10]Roberto Baldacci
Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47(1): 52-60 (2006) - 2004
- [j9]Roberto Baldacci
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation. Oper. Res. 52(3): 422-439 (2004) - [j8]Roberto Baldacci
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation. Oper. Res. 52(5): 723-738 (2004) - 2003
- [j7]Roberto Baldacci
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections. Networks 42(1): 26-41 (2003) - 2002
- [j6]Roberto Baldacci
A new method for solving capacitated location problems based on a set partitioning approach. Comput. Oper. Res. 29(4): 365-386 (2002) - 2001
- [j5]Paolo Toth, Hillel Bar-Gera, Diego Klabjan, Roberto Baldacci, Cenk Çaliskan, Christina Diakaki, Lasse Fridström, Vijay S. Nori:
Abstracts for the 2000 Transportation Science Section Dissertation Prize Competition. Transp. Sci. 35(1): 99-103 (2001) - 2000
- [j4]Lawrence Bodin, Aristide Mingozzi, Roberto Baldacci, Michael O. Ball:
The Rollon-Rolloff Vehicle Routing Problem. Transp. Sci. 34(3): 271-288 (2000)
1990 – 1999
- 1999
- [j3]Aristide Mingozzi, Simone Giorgi, Roberto Baldacci:
An Exact Method for the Vehicle Routing Problem with Backhauls. Transp. Sci. 33(3): 315-329 (1999) - 1998
- [j2]Vittorio Maniezzo, Aristide Mingozzi, Roberto Baldacci:
A Bionomic Approach to the Capacitated p-Median Problem. J. Heuristics 4(3): 263-280 (1998) - [j1]Eleni Hadjiconstantinou, Roberto Baldacci:
A multi-depot period vehicle routing problem arising in the utilities sector. J. Oper. Res. Soc. 49(12): 1239-1248 (1998)
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-07 21:23 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: