Roberto Baldacci
Industrial and Manufacturing Engineering · 2004–2012
A researcher in the Science corpus: 4 papers; trusts 17 researchers and is trusted by 10 researchers here, as inferred from the citation graph.
Subfields
- Industrial and Manufacturing Engineering — 18 citations into it; #292 of 2,521 by trust here, #737 by citations
- Automotive Engineering — 14 citations into it; #574 of 3,081 by trust here, #1,931 by citations
- Building and Construction — 6 citations into it; #903 of 2,909 by trust here, #1,783 by citations
Whom Roberto Baldacci trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Jens Lysgaard
- Giovanni Righini
- Ricardo Fukasawa
- Gerhard Reinelt
- Patric R. J. Östergård
- Mads Kehlet Jepsen
- Aristide Mingozzi
- Adam N. Letchford
- Matteo Salani
- Dominique Feillet
Who trusts Roberto Baldacci overall
- Gilbert Laporte
- Aristide Mingozzi
- Michael Schneider
- Roberto Roberti
- Jean-François Cordeau
- Guy Desaulniers
- Ismail Karaoglan
- Manuel Iori
- Michael Drexl
- Stefan Røpke
Papers from Roberto Baldacci's perspective
Ordered by how strongly the researchers Roberto Baldacci trusts endorse each paper. Same corpus, a different order for every researcher.
- A new branch-and-cut algorithm for the capacitated vehicle routing problem (Mathematical programming)
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (Mathematical programming)
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems (Networks)
- TSPLIB - A Traveling Salesman Problem Library
- Selected Topics in Column Generation (Operational Research)
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Mathematical programming)
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation (Operational Research)
- Classical and modern heuristics for the vehicle routing problem
- A fast algorithm for the maximum clique problem (Discrete Applied Mathematics)
Their papers
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (2012) — 509 citations
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem (2011) — 551 citations
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (2008) — 414 citations
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation (2004) — 324 citations