The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gilbert Laporte: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael W. Carter, Gilbert Laporte
    Recent Developments in Practical Examination Timetabling. [Citation Graph (0, 0)][DBLP]
    PATAT, 1995, pp:3-21 [Conf]
  2. Michael W. Carter, Gilbert Laporte
    Recent Developments in Practical Course Timetabling. [Citation Graph (0, 0)][DBLP]
    PATAT, 1997, pp:3-19 [Conf]
  3. 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]
  4. Fayez F. Boctor, Gilbert Laporte, Jacques Renaud
    Heuristics for the traveling purchaser problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:491-504 [Journal]
  5. Mélanie Bourgeois, Gilbert Laporte, Frédéric Semet
    Heuristics for the black and white traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:1, pp:75-85 [Journal]
  6. Jean-Marie Bourjolly, Gilbert Laporte, Gilles Pesant
    Heuristics for finding k-clubs in an undirected graph. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2000, v:27, n:6, pp:559-569 [Journal]
  7. Luce Brotcorne, Gilbert Laporte, Frédéric Semet
    Fast heuristics for large scale covering-location problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2002, v:29, n:6, pp:651-665 [Journal]
  8. Giuseppe Bruno, Michel Gendreau, Gilbert Laporte
    A heuristic for the location of a rapid transit line. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2002, v:29, n:1, pp:1-12 [Journal]
  9. Jacques Desrosiers, Gilbert Laporte, Michel Sauve, François Soumis, Serge Taillefer
    Vehicle routing with full loads. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1988, v:15, n:3, pp:219-226 [Journal]
  10. Paulo M. França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller
    A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1994, v:21, n:2, pp:205-210 [Journal]
  11. Michel Gendreau, Alain Hertz, Gilbert Laporte
    The Traveling Salesman Problem with Backhauls. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1996, v:23, n:5, pp:501-508 [Journal]
  12. Michel Gendreau, Gilbert Laporte, Christophe Musaraganyi, Éric D. Taillard
    A tabu search heuristic for the heterogeneous fleet vehicle routing problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1999, v:26, n:12, pp:1153-1173 [Journal]
  13. Michel Gendreau, Gilbert Laporte, Frédéric Semet
    Heuristics and lower bounds for the bin packing problem with conflicts. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2004, v:31, n:3, pp:347-358 [Journal]
  14. Michel Gendreau, Gilbert Laporte, Daniele Vigo
    Heuristics for the traveling salesman problem with pickup and delivery. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1999, v:26, n:7, pp:699-714 [Journal]
  15. Bruce L. Golden, Gilbert Laporte, Éric D. Taillard
    An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1997, v:24, n:5, pp:445-452 [Journal]
  16. Mondher Hachicha, M. John Hodgson, Gilbert Laporte, Frédéric Semet
    Heuristics for the multi-vehicle covering tour problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2000, v:27, n:1, pp:29-42 [Journal]
  17. Martine Labbé, Gilbert Laporte, Patrick Soriano
    Covering a graph with cycles. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1998, v:25, n:6, pp:499-504 [Journal]
  18. Véronique Lambert, Gilbert Laporte, François V. Louveaux
    Designing collection routes through bank branches. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1993, v:20, n:7, pp:783-791 [Journal]
  19. Gilbert Laporte
    Modeling and solving several classes of arc routing problems as traveling salesman problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1997, v:24, n:11, pp:1057-1061 [Journal]
  20. Gilbert Laporte, Sylvain Desroches
    Examination timetabling by computer. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1984, v:11, n:4, pp:351-360 [Journal]
  21. Gilbert Laporte, Sylvain Desroches
    The problem of assigning students to course sections in a large engineering school. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1986, v:13, n:4, pp:387-394 [Journal]
  22. Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega
    Locating stations on rapid transit lines. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2002, v:29, n:6, pp:741-759 [Journal]
  23. Jacques Renaud, Fayez F. Boctor, Gilbert Laporte
    Perturbation heuristics for the pickup and delivery traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2002, v:29, n:9, pp:1129-1141 [Journal]
  24. Jacques Renaud, Gilbert Laporte, Fayez F. Boctor
    A tabu search heuristic for the multi-depot vehicle routing problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 1996, v:23, n:3, pp:229-235 [Journal]
  25. Moshe Dror, Gilbert Laporte, Pierre Trudeau
    Vehicle routing with split deliveries. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:3, pp:239-254 [Journal]
  26. Martine Labbé, Gilbert Laporte, Silvano Martello
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:1- [Journal]
  27. Horst A. Eiselt, Michel Gendreau, Gilbert Laporte
    Optimal Location of Facilities on a Network with an Unreliable Node or Link. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:58, n:2, pp:71-74 [Journal]
  28. Patrizia Beraldi, Gianpaolo Ghiani, Gilbert Laporte, Roberto Musmanno
    Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:4, pp:195-198 [Journal]
  29. 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]
  30. Corinne Feremans, Martine Labbé, Gilbert Laporte
    A comparative analysis of several formulations for the generalized minimum spanning tree problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2002, v:39, n:1, pp:29-34 [Journal]
  31. Corinne Feremans, Martine Labbé, Gilbert Laporte
    The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:43, n:2, pp:71-86 [Journal]
  32. Michel Gendreau, Gilbert Laporte, Frédéric Semet
    A branch-and-cut algorithm for the undirected selective traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:32, n:4, pp:263-273 [Journal]
  33. Gianpaolo Ghiani, Gennaro Improta, Gilbert Laporte
    The capacitated arc routing problem with intermediate facilities. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:37, n:3, pp:134-143 [Journal]
  34. Gianpaolo Ghiani, Gilbert Laporte
    Eulerian location problems. [Citation Graph (0, 0)][DBLP]
    Networks, 1999, v:34, n:4, pp:291-302 [Journal]
  35. Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González
    The Ring Star Problem: Polyhedral analysis and exact algorithm. [Citation Graph (0, 0)][DBLP]
    Networks, 2004, v:43, n:3, pp:177-189 [Journal]
  36. Yazid M. Sharaiha, Michel Gendreau, Gilbert Laporte, Ibrahim H. Osman
    A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:3, pp:161-171 [Journal]
  37. Gilbert Laporte
    Book review. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:4, pp:394-397 [Journal]
  38. 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]
  39. Michel Gendreau, Gilbert Laporte, Frédéric Semet
    A dynamic model and parallel tabu search heuristic for real-time ambulance relocation. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2001, v:27, n:12, pp:1641-1653 [Journal]
  40. Gilbert Laporte, Roberto Musmanno
    Parallel computing in logistics. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2003, v:29, n:5, pp:553-554 [Journal]
  41. Nicholas G. Hall, Gilbert Laporte, Esaignani Selvarajah, Chelliah Sriskandarajah
    Scheduling and Lot Streaming in Flowshops with No-Wait in Process. [Citation Graph (0, 0)][DBLP]
    J. Scheduling, 2003, v:6, n:4, pp:339-354 [Journal]
  42. Shoshana Anily, Michel Gendreau, Gilbert Laporte
    The Swapping Problem on a Line. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:327-335 [Journal]
  43. 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]
  44. 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]
  45. Ardavan Asef-Vaziri, Gilbert Laporte, Robert Ortiz
    Exact and heuristic procedures for the material handling circular flow path design problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:176, n:2, pp:707-726 [Journal]
  46. 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]
  47. Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte
    Heuristic and lower bound for a stochastic location-routing problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:179, n:3, pp:940-955 [Journal]
  48. Dag Haugland, Sin C. Ho, Gilbert Laporte
    Designing delivery districts for the vehicle routing problem with stochastic demands. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:180, n:3, pp:997-1010 [Journal]
  49. Edgar Alberto Cabral, Erhan Erkut, Gilbert Laporte, Raymond A. Patterson
    The network design problem with relays. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:180, n:2, pp:834-844 [Journal]
  50. Irina Gribkovskaia Sr., Øyvind Halskau, Gilbert Laporte, Martin Vlcek
    General solutions to the single vehicle routing problem with pickups and deliveries. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:180, n:2, pp:568-584 [Journal]
  51. Éric Duchenne, Gilbert Laporte, Frédéric Semet
    Branch-and-cut algorithms for the undirected m. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:162, n:3, pp:700-712 [Journal]
  52. Ardavan Asef-Vaziri, Gilbert Laporte
    Loop based facility planning and material handling. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:164, n:1, pp:1-11 [Journal]
  53. Martine Labbé, Gilbert Laporte, Inmaculada Rodríguez Martín, Juan José Salazar González
    Locating median cycles in networks. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2005, v:160, n:2, pp:457-470 [Journal]
  54. Imdat Kara, Gilbert Laporte, Tolga Bektas
    A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:158, n:3, pp:793-795 [Journal]
  55. Edgar Alberto Cabral, Michel Gendreau, Gianpaolo Ghiani, Gilbert Laporte
    Solving the hierarchical Chinese postman problem as a rural postman problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:155, n:1, pp:44-50 [Journal]
  56. Gianpaolo Ghiani, Francesca Guerriero, Gilbert Laporte, Roberto Musmanno
    Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:151, n:1, pp:1-11 [Journal]
  57. Burçin Bozkaya, Erhan Erkut, Gilbert Laporte
    A tabu search heuristic and adaptive memory procedure for political districting. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:144, n:1, pp:12-26 [Journal]
  58. Luce Brotcorne, Gilbert Laporte, Frédéric Semet
    Ambulance location and relocation models. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:147, n:3, pp:451-463 [Journal]
  59. Corinne Feremans, Martine Labbé, Gilbert Laporte
    Generalized network design problems. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:148, n:1, pp:1-13 [Journal]
  60. Martine Labbé, Gilbert Laporte, Silvano Martello
    Upper bounds and algorithms for the maximum cardinality bin packing problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2003, v:149, n:3, pp:490-498 [Journal]

  61. An Integrated Methodology for the Rapid Transit Network Design Problem. [Citation Graph (, )][DBLP]


  62. The single vehicle routing problem with deliveries and selective pickups. [Citation Graph (, )][DBLP]


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


  64. A comparative analysis of several asymmetric traveling salesman problem formulations. [Citation Graph (, )][DBLP]


  65. The capacity and distance constrained plant location problem. [Citation Graph (, )][DBLP]


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


  67. The petrol station replenishment problem with time windows. [Citation Graph (, )][DBLP]


  68. A continuous analysis framework for the solution of location-allocation problems with dense demand. [Citation Graph (, )][DBLP]


  69. Heuristics for the mixed swapping problem. [Citation Graph (, )][DBLP]


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


  71. A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand. [Citation Graph (, )][DBLP]


  72. Minimum cost path problems with relays. [Citation Graph (, )][DBLP]


  73. A large neighbourhood search heuristic for ship routing and scheduling with split loads. [Citation Graph (, )][DBLP]


  74. The selective travelling salesman problem. [Citation Graph (, )][DBLP]


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


Search in 0.006secs, Finished in 0.009secs
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