Roberto Baldacci

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 37

Top Topics

Routing Problem

Top Venues

Eur. J. Oper. Res.

INFORMS J. Comput.

Publications

Zhitao Xu, Adel Elomri, Roberto Baldacci, Laoucine Kerbache, Zhenyong Wu
Correction: Frontiers and trends of supply chain optimization in the age of industry 4.0: an operations research perspective. Ann. Oper. Res. 335 (1) (2024)
Farid Kochakkashani, Vahid Kayvanfar, Roberto Baldacci
Innovative Applications of Unsupervised Learning in Uncertainty-Aware Pharmaceutical Supply Chain Planning. IEEE Access 12 (2024)
Zhenzhen Zhang, Yu Zhang, Roberto Baldacci
Generalized Riskiness Index in Vehicle Routing Under Uncertain Travel Times: Formulations, Properties, and Exact Solution Framework. Transp. Sci. 58 (4) (2024)
Roberto Baldacci, Stefano Coniglio, Jean-François Cordeau, Fabio Furini
A Numerically Exact Algorithm for the Bin-Packing Problem. INFORMS J. Comput. 36 (1) (2024)
Defeng Sun, Lixin Tang, Roberto Baldacci, Zihan Chen
A Decomposition Method for the Group-Based Quay Crane Scheduling Problem. INFORMS J. Comput. 36 (2) (2024)
Zhitao Xu, Adel Elomri, Roberto Baldacci, Laoucine Kerbache, Zhenyong Wu
Frontiers and trends of supply chain optimization in the age of industry 4.0: an operations research perspective. Ann. Oper. Res. 338 (2) (2024)
Shengnan Shu, Zhou Xu, Roberto Baldacci
Incorporating Holding Costs in Continuous-Time Service Network Design: New Model, Relaxation, and Exact Algorithm. Transp. Sci. 58 (2) (2024)
Jiliu Li, Zhixing Luo, Roberto Baldacci, Hu Qin, Zhou Xu
A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries. INFORMS J. Comput. 35 (1) (2023)
Yiming Liu, Roberto Baldacci, Jianwen Zhou, Yang Yu, Yu Zhang, Wei Sun
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) (2023)
Md Al Amin, Roberto Baldacci, Anika Tabassum Promi
Identification and Prioritization of Lean Supply Chain Management Factors Using Analytical Hierarchy Process. IEEM (2023)
Lu Zhen, Jiajing Gao, Zheyi Tan, Gilbert Laporte, Roberto Baldacci
Territorial design for customers with demand frequency. Eur. J. Oper. Res. 309 (1) (2023)
Yiming Liu, Yang Yu, Yu Zhang, Roberto Baldacci, Jiafu Tang, Xinggang Luo, Wei Sun
Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows. INFORMS J. Comput. 35 (1) (2023)
Roberto Baldacci, Edna Ayako Hoshino, Alessandro Hill
New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems. Eur. J. Oper. Res. 307 (2) (2023)
Baobin Huang, Lixin Tang, Roberto Baldacci, Gongshu Wang, Defeng Sun
A metaheuristic algorithm for a locomotive routing problem arising in the steel industry. Eur. J. Oper. Res. 308 (1) (2023)
Qian Hu, Zhenzhen Zhang, Roberto Baldacci, Christos D. Tarantilis, Emmanouil E. Zachariadis
The bus sightseeing problem. Int. Trans. Oper. Res. 30 (6) (2023)
Alessandro Hill, Roberto Baldacci, Stefan Voß
Optimal Steiner trees under node and edge privacy conflicts. J. Comb. Optim. 43 (5) (2022)
Lu Zhen, Roberto Baldacci, Zheyi Tan, Shuaian Wang, Junyan Lyu
Scheduling heterogeneous delivery tasks on a mixed logistics platform. Eur. J. Oper. Res. 298 (2) (2022)
Roberto Baldacci, Marco Caserta, Emiliano Traversi, Roberto Wolfler Calvo
Robustness of solutions to the capacitated facility location problem with uncertain demand. Optim. Lett. 16 (9) (2022)
Kai Wang, Lu Zhen, Jun Xia, Roberto Baldacci, Shuaian Wang
Routing Optimization with Generalized Consistency Requirements. Transp. Sci. 56 (1) (2022)
Liyang Xiao, Lu Zhen, Gilbert Laporte, Roberto Baldacci, Chenghao Wang
A column generation-based heuristic for a rehabilitation patient scheduling and routing problem. Comput. Oper. Res. 148 (2022)
Zhenzhen Zhang, Zhixing Luo, Roberto Baldacci, Andrew Lim
A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy. Transp. Sci. 55 (1) (2021)
Defeng Sun, Lixin Tang, Roberto Baldacci, Andrew Lim
An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability. Eur. J. Oper. Res. 291 (1) (2021)
Lijun Wei, Zhixing Luo, Roberto Baldacci, Andrew Lim
A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems. INFORMS J. Comput. 32 (2) (2020)
Roberto Baldacci, Andrew Lim, Emiliano Traversi, Roberto Wolfler Calvo
Optimal Solution of Vehicle Routing Problems with Fractional Objective Function. Transp. Sci. 54 (2) (2020)
Alessandro Hill, Roberto Baldacci, Edna Ayako Hoshino
Capacitated ring arborescence problems with profits. OR Spectr. 41 (2) (2019)
Yu Zhang, Roberto Baldacci, Melvyn Sim, Jiafu Tang
Routing optimization with time windows under uncertainty. Math. Program. 175 (1-2) (2019)
Alessandro Hill, Stefan Voß, Roberto Baldacci
Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts. COCOON (2019)
Ulrich Breunig, Roberto Baldacci, Richard F. Hartl, Thibaut Vidal
The electric two-echelon vehicle routing problem. Comput. Oper. Res. 103 (2019)
Fabio Henrique N. Abe, Edna Ayako Hoshino, Alessandro Hill, Roberto Baldacci
A Branch-and-Price Algorithm for the Ring-Tree Facility Location Problem. LAGOS (2019)
Defeng Sun, Lixin Tang, Roberto Baldacci
A Benders decomposition-based framework for solving quay crane scheduling problems. Eur. J. Oper. Res. 273 (2) (2019)
Luca Ghezzi, Roberto Baldacci
A Euclidean Algorithm for Binary Cycles with Minimal Variance. CoRR (2018)
Lin Zhou, Roberto Baldacci, Daniele Vigo, Xu Wang
A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution. Eur. J. Oper. Res. 265 (2) (2018)
Ting Wang, Roberto Baldacci, Andrew Lim, Qian Hu
A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine. Eur. J. Oper. Res. 271 (3) (2018)
Ulrich Breunig, Roberto Baldacci, Richard F. Hartl, Thibaut Vidal
The Electric Two-echelon Vehicle Routing Problem. CoRR (2018)
Roberto Wolfler Calvo, Lucas Létocart, Roberto Baldacci
Preface: Emerging challenges in transportation planning. Networks 72 (3) (2018)
Roberto Baldacci, Sandra Ulrich Ngueveu, Roberto Wolfler Calvo
The Vehicle Routing Problem with Transhipment Facilities. Transp. Sci. 51 (2) (2017)
Roberto Baldacci, Alessandro Hill, Edna Ayako Hoshino, Andrew Lim
Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms. Eur. J. Oper. Res. 262 (3) (2017)
Roberto Baldacci, Marco A. Boschetti, Maurizio Ganovelli, Vittorio Maniezzo
Algorithms for nesting with defects. Discret. Appl. Math. 163 (2014)
Christos D. Tarantilis, Roberto Baldacci
Editorial. Networks 64 (3) (2014)
Roberto Baldacci, Aristide Mingozzi, Roberto Roberti, Roberto Wolfler Calvo
An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem. Oper. Res. 61 (2) (2013)
Roberto Baldacci, Aristide Mingozzi, Roberto Roberti
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 24 (3) (2012)
Roberto Baldacci, Aristide Mingozzi, Roberto Roberti
Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218 (1) (2012)
Roberto Baldacci, Aristide Mingozzi, Roberto Roberti
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem. Oper. Res. 59 (5) (2011)
Roberto Baldacci, Enrico Bartolini, Aristide Mingozzi
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows. Oper. Res. 59 (2) (2011)
Roberto Baldacci, Enrico Bartolini, Aristide Mingozzi, Andrea Valletta
An Exact Algorithm for the Period Routing Problem. Oper. Res. 59 (1) (2011)
Roberto Baldacci, Aristide Mingozzi, Roberto Wolfler Calvo
An Exact Method for the Capacitated Location-Routing Problem. Oper. Res. 59 (5) (2011)
Roberto Baldacci, Mauro Dell'Amico
Heuristic algorithms for the multi-depot ring-star problem. Eur. J. Oper. Res. 203 (1) (2010)
Roberto Baldacci, Enrico Bartolini, Aristide Mingozzi, Roberto Roberti
An exact solution framework for a broad class of vehicle routing problems. Comput. Manag. Sci. 7 (3) (2010)
Roberto Baldacci, Paolo Toth, Daniele Vigo
Exact algorithms for routing problems under vehicle capacity constraints. Ann. Oper. Res. 175 (1) (2010)
Roberto Baldacci, Enrico Bartolini, Gilbert Laporte
Some applications of the generalized vehicle routing problem. J. Oper. Res. Soc. 61 (7) (2010)
Roberto Baldacci, Maria Battarra, Daniele Vigo
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs. Networks 54 (4) (2009)
Roberto Baldacci, Marco A. Boschetti, Nicos Christofides, Simon Christofides
Exact methods for large-scale multi-period financial planning problems. Comput. Manag. Sci. 6 (3) (2009)
Roberto Baldacci, Aristide Mingozzi
A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120 (2) (2009)
Roberto Baldacci, Nicos Christofides, Aristide Mingozzi
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Program. 115 (2) (2008)
Roberto Baldacci, Paolo Toth, Daniele Vigo
Recent advances in vehicle routing exact algorithms. 4OR 5 (4) (2007)
Roberto Baldacci, Marco A. Boschetti
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem. Eur. J. Oper. Res. 183 (3) (2007)
Roberto Baldacci, Mauro Dell'Amico, J. Salazar González
-Ring-Star Problem. Oper. Res. 55 (6) (2007)
Roberto Baldacci, Vittorio Maniezzo
Exact methods based on node-routing formulations for undirected arc-routing problems. Networks 47 (1) (2006)
Roberto Baldacci, Lawrence Bodin, Aristide Mingozzi
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Comput. Oper. Res. 33 (2006)
Roberto Baldacci, Vittorio Maniezzo, Aristide Mingozzi
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation. Oper. Res. 52 (3) (2004)
Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation. Oper. Res. 52 (5) (2004)
Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections. Networks 42 (1) (2003)
Roberto Baldacci, Eleni Hadjiconstantinou, Vittorio Maniezzo, Aristide Mingozzi
A new method for solving capacitated location problems based on a set partitioning approach. Comput. Oper. Res. 29 (4) (2002)
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) (2001)
Lawrence Bodin, Aristide Mingozzi, Roberto Baldacci, Michael O. Ball
The Rollon-Rolloff Vehicle Routing Problem. Transp. Sci. 34 (3) (2000)
Aristide Mingozzi, Simone Giorgi, Roberto Baldacci
An Exact Method for the Vehicle Routing Problem with Backhauls. Transp. Sci. 33 (3) (1999)
Vittorio Maniezzo, Aristide Mingozzi, Roberto Baldacci
A Bionomic Approach to the Capacitated p-Median Problem. J. Heuristics 4 (3) (1998)
Eleni Hadjiconstantinou, Roberto Baldacci
A multi-depot period vehicle routing problem arising in the utilities sector. J. Oper. Res. Soc. 49 (12) (1998)