 | Up a level |
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2012). Feasibility of the pickup and delivery problem with fixed partial routes: A complexity analysis. Transportation Science, 46(3), 359-373. External link
Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2011). Checking the feasibility of dial-a-ride instances using constraint programming. Transportation Science, 45(3), 399-412. External link
Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2010). Checking the Feasibility of Dial-a-Ride Instances using Constraint Programming. (Technical Report n° CIRRELT-2010-16). External link
Berbeglia, G., Pesant, G., & Rousseau, L.-M. (2010). Feasibility of the pickup and delivery problem with fixed partial routes: A complexity Analysis. (Technical Report n° CIRRELT-2010-15). External link
