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