Roberto Baldacci
Orcid: 0000-0003-0938-5798Affiliations:
- University of Bologna, Italy
According to our database1,
Roberto Baldacci
authored at least 67 papers
between 1998 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Frontiers and trends of supply chain optimization in the age of industry 4.0: an operations research perspective.
Ann. Oper. Res., July, 2024
Correction: Frontiers and trends of supply chain optimization in the age of industry 4.0: an operations research perspective.
Ann. Oper. Res., April, 2024
Generalized Riskiness Index in Vehicle Routing Under Uncertain Travel Times: Formulations, Properties, and Exact Solution Framework.
Transp. Sci., 2024
Incorporating Holding Costs in Continuous-Time Service Network Design: New Model, Relaxation, and Exact Algorithm.
Transp. Sci., 2024
INFORMS J. Comput., 2024
Innovative Applications of Unsupervised Learning in Uncertainty-Aware Pharmaceutical Supply Chain Planning.
IEEE Access, 2024
2023
Eur. J. Oper. Res., August, 2023
A metaheuristic algorithm for a locomotive routing problem arising in the steel industry.
Eur. J. Oper. Res., July, 2023
New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems.
Eur. J. Oper. Res., June, 2023
Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows.
INFORMS J. Comput., 2023
A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries.
INFORMS J. Comput., 2023
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., 2023
Identification and Prioritization of Lean Supply Chain Management Factors Using Analytical Hierarchy Process.
Proceedings of the IEEE International Conference on Industrial Engineering and Engineering Management, 2023
2022
Robustness of solutions to the capacitated facility location problem with uncertain demand.
Optim. Lett., 2022
Eur. J. Oper. Res., 2022
A column generation-based heuristic for a rehabilitation patient scheduling and routing problem.
Comput. Oper. Res., 2022
2021
A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy.
Transp. Sci., 2021
An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability.
Eur. J. Oper. Res., 2021
2020
Transp. Sci., 2020
INFORMS J. Comput., 2020
2019
Eur. J. Oper. Res., 2019
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019
2018
A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution.
Eur. J. Oper. Res., 2018
A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine.
Eur. J. Oper. Res., 2018
2017
Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms.
Eur. J. Oper. Res., 2017
2014
2013
Oper. Res., 2013
2012
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows.
INFORMS J. Comput., 2012
Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints.
Eur. J. Oper. Res., 2012
2011
Oper. Res., 2011
Oper. Res., 2011
2010
J. Oper. Res. Soc., 2010
Comput. Manag. Sci., 2010
Ann. Oper. Res., 2010
2009
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs.
Networks, 2009
Math. Program., 2009
Comput. Manag. Sci., 2009
2008
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts.
Math. Program., 2008
2007
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem.
Eur. J. Oper. Res., 2007
2006
Exact methods based on node-routing formulations for undirected arc-routing problems.
Networks, 2006
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem.
Comput. Oper. Res., 2006
2004
Oper. Res., 2004
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation.
Oper. Res., 2004
2003
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections.
Networks, 2003
2002
A new method for solving capacitated location problems based on a set partitioning approach.
Comput. Oper. Res., 2002
2001
Abstracts for the 2000 Transportation Science Section Dissertation Prize Competition.
Transp. Sci., 2001
2000
1999
1998
J. Oper. Res. Soc., 1998