Jean-François Cordeau and Gilbert Laporte - Free people check

(1 - 13 from 13

)

Approximate Dynamic Programming for Dynamic Vehicle Routing - Marlin...

books.google.com.ua

Cleophas, Catherine, and Jan F. Ehmke When are deliveries profitable? Business and Information Systems Engineering 6 (3): 153–163. Coelho, Leandro C., Jean-François Cordeau, and Gilbert Laporte Heuristics for dynamic and stochastic inventory-routing. Computers and Operations Research 52: 55–67.

CiteSeerX — Dynamic pickup and delivery problems

citeseerx.ist.psu.edu

BibTeX @ARTICLE{Berbeglia_dynamicpickup, author = {Gerardo Berbeglia and Jean-françois Cordeau and Gilbert Laporte}, title = {Dynamic pickup and delivery …

A multi-directional local search metaheuristic for a bi-objective dial-a ...

uhdspace.uhasselt.be

[2] Jean-François Cordeau. A branch-and-cut algorithm for the dial-a-ride problem. Operations. Research, 54(3):573–586, [3] Jean-François Cordeau and Gilbert Laporte. A tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B: Methodological, 37(6):579–594,

CiteSeerX — DTU Management Engineering The Dynamic Multi-Period...

citeseerx.ist.psu.edu

BibTeX @MISC{Wen09dtumanagement, author = {Min Wen and Jean-françois Cordeau and Gilbert Laporte and Jesper Larsen and Min Wen and Jean-françois Cordeau and …

EconPapers: Stochastic uncapacitated hub location

econpapers.repec.org

By Ivan Contreras, Jean-François Cordeau and Gilbert Laporte; Abstract: We study stochastic uncapacitated hub location problems in which uncertainty is associated to ...

The traveling salesman problem with pickup and delivery: polyhedral...

link.springer.com

Jean-François Cordeau (3) Gilbert Laporte (2) Author Affiliations. 1. School of Mathematics and Statistics, The University of Sydney, Sydney, NSW, 2052, Australia ...

The dial-a-ride problem: models and algorithms | SpringerLink

link.springer.com

The dial-a-ride problem: models and algorithms. Authors; Authors and affiliations. Jean-François Cordeau Email author; Gilbert Laporte.

The Dial-a-Ride Problem (DARP): Variants, modeling issues and...

link.springer.com

The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. Authors; Authors and affiliations. Jean-François Cordeau; Gilbert LaporteEmail author. Jean-François Cordeau. 1. Gilbert Laporte. 1. Email author. 1.GERAD-HEC MontréalMontréalCanada H3T 2A7. Article. Received: 01 June ...

All web results to the name "Jean-François Cordeau"

Nicola Bianchessi - Citazioni di Google Scholar

scholar.google.com.au

M.Grazia Speranza,; Claudia Archetti,; Renata Mansini,; Alain Hertz,; Enrico Angelelli,; Jacques Desrosiers,; Jean-François Cordeau,; Gilbert Laporte,; Stefan ...

Ph.D. Theses on Routing and Logistics | VeRoLog

verolog.deis.unibo.it

List of recent Ph.D. Theses related to Vehicle Routing and Logistics Optimization ... Supervisors: Jean-François Cordeau and Gilbert Laporte. Benjamin Dussault.

Models and a Branch-and-Cut Algorithm for Pickup and Delivery...

orbit.dtu.dk

Røpke, Stefan, Jean-François Cordeau and Gilbert Laporte. "Models and a Branch-and-Cut Algorithm for Pickup and Delivery Problems with Time Windows".

E. Hyytiä: Dial-a-ride problem

notendur.hi.is

Jean-François Cordeau and Gilbert Laporte, The dial-a-ride problem: models and algorithms, Annals of Operations Research, vol. 153, no. 1, pp , Springer, September G. Berbeglia and J.-F. Cordeau and G. Laporte, Dynamic Pickup and Delivery Problems, European Journal of Operational Research, vol

Talks - Prof. Leandro C. Coelho, Ph.D.

www.leandro-coelho.com

People. Claudio Contardo · Gilbert Laporte · Guy Desaulniers · Iris F. A. Vis · Jacques Renaud · Jean-François Cordeau · Kees Jan Roodbergen · Marcos A. Pereira · Paul Buijs ...

Related search requests for Jean-François Cordeau

Ivan Contreras

People
Forename "Jean-François" (3283)
Name "Cordeau" (76)

sorted by relevance / date

Advanced Search

Search name: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Jean-François Cordeau and Gilbert Laporte Free People Check