Articles with public access mandates - Roberto BaldacciLearn more
Not available anywhere: 8
A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems
L Wei, Z Luo, R Baldacci, A Lim
INFORMS Journal on Computing 32 (2), 428-443, 2020
Mandates: National Natural Science Foundation of China, National Research Foundation …
A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
T Wang, R Baldacci, A Lim, Q Hu
European Journal of Operational Research 271 (3), 826-838, 2018
Mandates: National Natural Science Foundation of China, National Research Foundation …
Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows
J Li, H Qin, R Baldacci, W Zhu
Transportation Research Part E, 2020
Mandates: National Natural Science Foundation of China
An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
D Sun, L Tang, R Baldacci, A Lim
European Journal of Operational Research 291 (1), 271-283, 2021
Mandates: National Natural Science Foundation of China
A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
B Huang, L Tang, R Baldacci, G Wang, D Sun
European Journal of Operational Research 308 (1), 385-399, 2023
Mandates: National Natural Science Foundation of China
A new exact algorithm for single-commodity vehicle routing with split pickups and deliveries
J Li, Z Luo, R Baldacci, H Qin, Z Xu
INFORMS Journal on Computing 35 (1), 31-49, 2023
Mandates: National Natural Science Foundation of China, Research Grants Council, Hong Kong
Territorial design for customers with demand frequency
L Zhen, J Gao, Z Tan, G Laporte, R Baldacci
European Journal of Operational Research 309 (1), 82-101, 2023
Mandates: National Natural Science Foundation of China
An Exact Method for a First-Mile Ridesharing Problem
S Wang, R Baldacci, Y Yu, Y Zhang, J Tang, X Luo, W Sun
Transportation Science, 2023
Mandates: National Natural Science Foundation of China
Available somewhere: 13
Vehicle routing problems with drones equipped with multi-package payload compartments
MA Masmoudi, S Mancini, R Baldacci, YH Kuo
Transportation Research Part E: Logistics and Transportation Review 164, 102757, 2022
Mandates: Research Grants Council, Hong Kong
Routing optimization with time windows under uncertainty
Y Zhang, R Baldacci, M Sim, J Tang
Mathematical Programming 175, 263-305, 2019
Mandates: National Natural Science Foundation of China, National Research Foundation …
A benders decomposition-based framework for solving quay crane scheduling problems
D Sun, L Tang, R Baldacci
European Journal of Operational Research 273 (2), 504-515, 2019
Mandates: National Natural Science Foundation of China
Branch-price-and-cut for trucks and drones cooperative delivery
L Zhen, J Gao, Z Tan, S Wang, R Baldacci
IISE Transactions 55 (3), 271-287, 2023
Mandates: National Natural Science Foundation of China
A benders decomposition approach for the multivehicle production routing problem with order-up-to-level policy
Z Zhang, Z Luo, R Baldacci, A Lim
Transportation Science 55 (1), 160-178, 2021
Mandates: National Natural Science Foundation of China, National Research Foundation …
Routing optimization with generalized consistency requirements
K Wang, L Zhen, J Xia, R Baldacci, S Wang
Transportation Science 56 (1), 223-244, 2022
Mandates: National Natural Science Foundation of China
A heuristic algorithm for solving a large-scale real-world territory design problem
L Zhou, L Zhen, R Baldacci, M Boschetti, Y Dai, A Lim
Omega 103, 102442, 2021
Mandates: National Natural Science Foundation of China
Branch-cut-and-price for the time-dependent green vehicle routing problem with time windows
Y Liu, Y Yu, Y Zhang, R Baldacci, J Tang, X Luo, W Sun
INFORMS Journal on Computing 35 (1), 14-30, 2023
Mandates: National Natural Science Foundation of China
Scheduling heterogeneous delivery tasks on a mixed logistics platform
L Zhen, R Baldacci, Z Tan, S Wang, J Lyu
European Journal of Operational Research 298 (2), 680-698, 2022
Mandates: National Natural Science Foundation of China
Optimal solution of vehicle routing problems with fractional objective function
R Baldacci, A Lim, E Traversi, R Wolfler Calvo
Transportation Science 54 (2), 434-452, 2020
Mandates: National Research Foundation, Singapore
A column generation-based heuristic for a rehabilitation patient scheduling and routing problem
L Xiao, L Zhen, G Laporte, R Baldacci, C Wang
Computers & Operations Research 148, 105970, 2022
Mandates: National Natural Science Foundation of China
Effective Exact Solution Framework for Routing Optimization with Time Windows and Travel Time Uncertainty
Z Zhang, Y Zhang, R Baldacci
Available at http://www.optimization-online.org/DB_HTML/2022/05/8911.html, 2022
Mandates: National Natural Science Foundation of China
Publication and funding information is determined automatically by a computer program