His primary areas of investigation include Mathematical optimization, Vehicle routing problem, Integer programming, Routing and Algorithm. Many of his studies on Mathematical optimization apply to Upper and lower bounds as well. As a part of the same scientific study, Roberto Baldacci usually deals with the Integer programming, concentrating on Heuristic and frequently concerns with Service and Path.
His study in Routing is interdisciplinary in nature, drawing from both Quality, Constraint, Linear programming relaxation and Operations research. His Combinatorial optimization study in the realm of Algorithm connects with subjects such as Time windows. As a part of the same scientific family, Roberto Baldacci mostly works in the field of Exact algorithm, focusing on Relaxation and, on occasion, Branch and cut and Flow network.
His main research concerns Mathematical optimization, Vehicle routing problem, Routing, Integer programming and Exact algorithm. His Mathematical optimization research includes themes of Algorithm and Upper and lower bounds. His research in Upper and lower bounds intersects with topics in Column generation and Facility location problem.
Roberto Baldacci has included themes like Heuristics, Combinatorial optimization, Dual and Operations research in his Vehicle routing problem study. His research investigates the link between Integer programming and topics such as Tree that cross with problems in Node, Steiner tree problem and Reduction. His Exact algorithm study combines topics in areas such as Benders' decomposition, Linear programming, Branch and cut, Quay crane and Solver.
Roberto Baldacci focuses on Mathematical optimization, Vehicle routing problem, Routing, Exact algorithm and Benders' decomposition. His study in the field of Heuristics and Travelling salesman problem also crosses realms of Benchmark, Ring and Service. His work on Routing is being expanded to include thematically relevant topics such as Function.
His Exact algorithm study results in a more complete grasp of Algorithm. Within one scientific family, Roberto Baldacci focuses on topics pertaining to Telecommunications network under Algorithm, and may sometimes address concerns connected to Node and Steiner tree problem. His Benders' decomposition research is multidisciplinary, incorporating elements of Quay crane and Job shop scheduling.
Roberto Baldacci mainly focuses on Mathematical optimization, Bin packing problem, Exact algorithm, Algorithm and Branch and price. In the subject of general Mathematical optimization, his work in Benders' decomposition is often linked to Workload, thereby combining diverse domains of study.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
Roberto Baldacci;Aristide Mingozzi;Roberto Roberti.
European Journal of Operational Research (2012)
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
Roberto Baldacci;Nicos Christofides;Aristide Mingozzi.
Mathematical Programming (2008)
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
Roberto Baldacci;Aristide Mingozzi;Roberto Roberti.
Operations Research (2011)
Routing a Heterogeneous Fleet of Vehicles
Roberto Baldacci;Maria Battarra;Daniele Vigo.
Operations Research/ Computer Science Interfaces Series (2008)
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
R. Baldacci;E. Hadjiconstantinou;A. Mingozzi.
Operations Research (2004)
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation
Roberto Baldacci;Vittorio Maniezzo;Aristide Mingozzi.
Operations Research (2004)
A unified exact method for solving different classes of vehicle routing problems
Roberto Baldacci;Aristide Mingozzi.
Mathematical Programming (2009)
Exact algorithms for routing problems under vehicle capacity constraints
Roberto Baldacci;Paolo Toth;Daniele Vigo.
Annals of Operations Research (2010)
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
Roberto Baldacci;Enrico Bartolini;Aristide Mingozzi.
Operations Research (2011)
An Exact Method for the Vehicle Routing Problem with Backhauls
Aristide Mingozzi;Simone Giorgi;Roberto Baldacci.
Transportation Science (1999)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Bologna
University of Bologna
National University of Singapore
University of Modena and Reggio Emilia
University of Bologna
HEC Montréal
Northwestern University
Northeastern University
Universität Hamburg
University of Maryland, College Park
ETH Zurich
University of Technology Sydney
University of Zaragoza
University of Queensland
Brunel University London
Tianjin Polytechnic University
University of California, San Diego
Memorial Sloan Kettering Cancer Center
University of Birmingham
University of Toyama
University of Debrecen
University of Wisconsin–Madison
Columbia University
University of Toronto
Max Planck Society
Utrecht University