The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jean-François Cordeau: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean-François Cordeau, Gilbert Laporte
    The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. [Citation Graph (0, 0)][DBLP]
    4OR, 2003, v:1, n:2, pp:89-101 [Journal]
  2. Anne Mercier, Jean-François Cordeau, François Soumis
    A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2005, v:32, n:, pp:1451-1476 [Journal]
  3. Jean-François Cordeau, Michel Gendreau, Gilbert Laporte
    A tabu search heuristic for periodic and multi-depot vehicle routing problems. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:30, n:2, pp:105-119 [Journal]
  4. Andrea Attanasio, Jean-François Cordeau, Gianpaolo Ghiani, Gilbert Laporte
    Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2004, v:30, n:3, pp:377-387 [Journal]
  5. Benoit Crevier, Jean-François Cordeau, Gilbert Laporte
    The multi-depot vehicle routing problem with inter-depot routes. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:176, n:2, pp:756-773 [Journal]
  6. Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia
    The service allocation problem at the Gioia Tauro Maritime Terminal. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:176, n:2, pp:1167-1184 [Journal]
  7. Nicola Bianchessi, Jean-François Cordeau, Jacques Desrosiers, Gilbert Laporte, Vincent Raymond
    A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:177, n:2, pp:750-762 [Journal]

  8. A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times. [Citation Graph (, )][DBLP]


  9. Exact algorithms for the joint object placement and request routing problem in content distribution networks. [Citation Graph (, )][DBLP]


  10. The pickup and delivery traveling salesman problem with first-in-first-out loading. [Citation Graph (, )][DBLP]


  11. A column generation heuristic for a dynamic generalized assignment problem. [Citation Graph (, )][DBLP]


  12. Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. [Citation Graph (, )][DBLP]


  13. The dynamic multi-period vehicle routing problem. [Citation Graph (, )][DBLP]


  14. A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002