Roberto Baldacci

From MaRDI portal
(Redirected from Person:237398)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The service-centric vehicle routing problem with crowdshipping
European Journal of Operational Research
2026-04-27Paper
Improving last-mile delivery efficiency using cargo bikes and autonomous robots
European Journal of Operational Research
2026-04-27Paper
Robot-aided electric vehicle routing problem with lockers and prime customers prioritization
European Journal of Operational Research
2026-02-09Paper
EATKG: an open-source efficient \underline{E}xact \underline{A}lgorithm for the \underline{T}wo-dimensional \underline{K}napsack problem with \underline{G}uillotine constraints
European Journal of Operational Research
2026-01-22Paper
On a variant of the minimum path cover problem in acyclic digraphs: computational complexity results and exact method
Networks
2025-12-05Paper
A simultaneous column-and-row generation solution method for liner shipping network design
Operations Research
2025-11-10Paper
A decomposition method for the group-based quay crane scheduling problem
INFORMS Journal on Computing
2024-07-29Paper
A Numerically Exact Algorithm for the Bin-Packing Problem
INFORMS Journal on Computing
2024-03-26Paper
A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries
INFORMS Journal on Computing
2024-02-27Paper
The bus sightseeing problem
International Transactions in Operational Research
2023-10-04Paper
Territorial design for customers with demand frequency
European Journal of Operational Research
2023-07-10Paper
A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
European Journal of Operational Research
2023-07-10Paper
New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
European Journal of Operational Research
2023-07-04Paper
Robustness of solutions to the capacitated facility location problem with uncertain demand
Optimization Letters
2022-11-01Paper
A column generation-based heuristic for a rehabilitation patient scheduling and routing problem
Computers & Operations Research
2022-09-27Paper
Optimal Steiner trees under node and edge privacy conflicts
Journal of Combinatorial Optimization
2022-07-18Paper
A branch-and-price algorithm for the ring-tree facility location problem2022-04-27Paper
Scheduling heterogeneous delivery tasks on a mixed logistics platform
European Journal of Operational Research
2022-02-22Paper
An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability
European Journal of Operational Research
2021-06-04Paper
A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
INFORMS Journal on Computing
2021-01-07Paper
Branch-and-cut algorithms for Steiner tree problems with privacy conflicts2020-02-24Paper
Capacitated ring arborescence problems with profits
OR Spectrum
2020-01-15Paper
Routing optimization with time windows under uncertainty
Mathematical Programming. Series A. Series B
2019-05-17Paper
The electric two-echelon vehicle routing problem
Computers & Operations Research
2018-12-17Paper
A Benders decomposition-based framework for solving quay crane scheduling problems
European Journal of Operational Research
2018-11-19Paper
A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
European Journal of Operational Research
2018-08-03Paper
Optimal Solution of Vehicle Routing Problems with Fractional Objective Function2018-04-09Paper
Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms
European Journal of Operational Research
2017-12-06Paper
A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
European Journal of Operational Research
2017-11-23Paper
New state-space relaxations for solving the traveling salesman problem with time windows
INFORMS Journal on Computing
2016-06-29Paper
Algorithms for nesting with defects
Discrete Applied Mathematics
2014-09-08Paper
An exact algorithm for the two-echelon capacitated vehicle routing problem
Operations Research
2013-07-02Paper
Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
European Journal of Operational Research
2012-08-16Paper
An exact method for the capacitated location-routing problem
Operations Research
2012-03-26Paper
New route relaxation and pricing strategies for the vehicle routing problem
Operations Research
2012-03-26Paper
An exact algorithm for the pickup and delivery problem with time windows
Operations Research
2011-11-18Paper
An exact algorithm for the period routing problem
Operations Research
2011-07-19Paper
Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs
Networks
2010-11-24Paper
An exact solution framework for a broad class of vehicle routing problems
Computational Management Science
2010-09-20Paper
Some applications of the generalized vehicle routing problem
The Journal of the Operational Research Society
2010-09-02Paper
Routing a heterogeneous fleet of vehicles
Operations Research/Computer Science Interfaces
2010-06-02Paper
Exact algorithms for routing problems under vehicle capacity constraints
Annals of Operations Research
2010-05-10Paper
Heuristic algorithms for the multi-depot ring-star problem
European Journal of Operational Research
2009-12-07Paper
Exact methods for large-scale multi-period financial planning problems
Computational Management Science
2009-09-03Paper
The Capacitated <i>m</i>-Ring-Star Problem
Operations Research
2009-08-13Paper
A unified exact method for solving different classes of vehicle routing problems
Mathematical Programming. Series A. Series B
2009-07-24Paper
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
Operations Research
2009-07-17Paper
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
Operations Research
2009-07-10Paper
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
Mathematical Programming. Series A. Series B
2008-10-16Paper
Recent advances in vehicle routing exact algorithms
4OR
2008-05-20Paper
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
European Journal of Operational Research
2007-08-27Paper
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
Computers & Operations Research
2006-05-16Paper
Exact methods based on node-routing formulations for undirected arc-routing problems
Networks
2006-03-24Paper
scientific article; zbMATH DE number 2209648 (Why is no real title available?)2005-09-28Paper
A multi-depot period vehicle routing problem arising in the utilities sector
The Journal of the Operational Research Society
2005-01-19Paper
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
Networks
2003-08-20Paper
An exact method for the vehicle routing problem with backhauls
Transportation Science
2002-10-17Paper
The Rollon-Rolloff vehicle routing problem
Transportation Science
2002-10-17Paper
A new method for solving capacitated location problems based on a set partitioning approach
Computers & Operations Research
2002-07-24Paper
A bionomic approach to the capacitated \(p\)-median problem
Journal of Heuristics
1999-01-06Paper


Research outcomes over time


This page was built for person: Roberto Baldacci