Roberto Baldacci

Orcid: 0000-0003-0938-5798

Affiliations:
  • University of Bologna, Italy


According to our database1, Roberto Baldacci authored at least 67 papers between 1998 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

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

A Decomposition Method for the Group-Based Quay Crane Scheduling Problem.
INFORMS J. Comput., 2024

A Numerically Exact Algorithm for the Bin-Packing Problem.
INFORMS J. Comput., 2024

Innovative Applications of Unsupervised Learning in Uncertainty-Aware Pharmaceutical Supply Chain Planning.
IEEE Access, 2024

2023
The bus sightseeing problem.
Int. Trans. Oper. Res., November, 2023

Territorial design for customers with demand frequency.
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
Routing Optimization with Generalized Consistency Requirements.
Transp. Sci., 2022

Robustness of solutions to the capacitated facility location problem with uncertain demand.
Optim. Lett., 2022

Optimal Steiner trees under node and edge privacy conflicts.
J. Comb. Optim., 2022

Scheduling heterogeneous delivery tasks on a mixed logistics platform.
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
Optimal Solution of Vehicle Routing Problems with Fractional Objective Function.
Transp. Sci., 2020

A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems.
INFORMS J. Comput., 2020

2019
Capacitated ring arborescence problems with profits.
OR Spectr., 2019

Routing optimization with time windows under uncertainty.
Math. Program., 2019

A Benders decomposition-based framework for solving quay crane scheduling problems.
Eur. J. Oper. Res., 2019

A Branch-and-Price Algorithm for the Ring-Tree Facility Location Problem.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

The electric two-echelon vehicle routing problem.
Comput. Oper. Res., 2019

Branch-and-Cut Algorithms for Steiner Tree Problems with Privacy Conflicts.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2018
Preface: Emerging challenges in transportation planning.
Networks, 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

A Euclidean Algorithm for Binary Cycles with Minimal Variance.
CoRR, 2018

2017
The Vehicle Routing Problem with Transhipment Facilities.
Transp. Sci., 2017

Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms.
Eur. J. Oper. Res., 2017

2014
Editorial.
Networks, 2014

Algorithms for nesting with defects.
Discret. Appl. Math., 2014

2013
An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem.
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
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem.
Oper. Res., 2011

An Exact Method for the Capacitated Location-Routing Problem.
Oper. Res., 2011

An Exact Algorithm for the Period Routing Problem.
Oper. Res., 2011

An Exact Algorithm for the Pickup and Delivery Problem with Time Windows.
Oper. Res., 2011

2010
Some applications of the generalized vehicle routing problem.
J. Oper. Res. Soc., 2010

Heuristic algorithms for the multi-depot ring-star problem.
Eur. J. Oper. Res., 2010

An exact solution framework for a broad class of vehicle routing problems.
Comput. Manag. Sci., 2010

Exact algorithms for routing problems under vehicle capacity constraints.
Ann. Oper. Res., 2010

2009
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs.
Networks, 2009

A unified exact method for solving different classes of vehicle routing problems.
Math. Program., 2009

Exact methods for large-scale multi-period financial planning problems.
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
The Capacitated <i>m</i>-Ring-Star Problem.
Oper. Res., 2007

A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem.
Eur. J. Oper. Res., 2007

Recent advances in vehicle routing exact algorithms.
4OR, 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
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation.
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
The Rollon-Rolloff Vehicle Routing Problem.
Transp. Sci., 2000

1999
An Exact Method for the Vehicle Routing Problem with Backhauls.
Transp. Sci., 1999

1998
A multi-depot period vehicle routing problem arising in the utilities sector.
J. Oper. Res. Soc., 1998

A Bionomic Approach to the Capacitated p-Median Problem.
J. Heuristics, 1998


  Loading...