- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j181 |      | Leandro C. Coelho, Gilbert Laporte: The exact solution of several classes of inventory-routing problems. Computers & OR 40(2): 558-565 (2013) |
| j180 | | M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte: The synchronized arc and node routing problem: Application to road marking. Computers & OR 40(7): 1708-1715 (2013) |
| j179 | | Verena Schmid, Karl F. Doerner, Gilbert Laporte: Rich routing problems arising in supply chain management. European Journal of Operational Research 224(3): 435-448 (2013) |
| j178 | | Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte: Improved lower bounds and exact algorithm for the capacitated arc routing problem. Math. Program. 137(1-2): 409-452 (2013) |
| j177 | | Günes Erdogan, Gilbert Laporte: The orienteering problem with variable profits. Networks 61(2): 104-116 (2013) |
| j176 | | Marie-Eve Rancourt, Jean-François Cordeau, Gilbert Laporte: Long-Haul Vehicle Routing and Scheduling with Working Hour Rules. Transportation Science 47(1): 81-107 (2013) |
| 2012 | ||
| j175 | | Glaydston Mattos Ribeiro, Gilbert Laporte: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Computers & OR 39(3): 728-735 (2012) |
| j174 | | Günes Erdogan, Maria Battarra, Gilbert Laporte, Daniele Vigo: Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs. Computers & OR 39(5): 1074-1086 (2012) |
| j173 | | M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte: Synchronized arc routing for snow plowing operations. Computers & OR 39(7): 1432-1440 (2012) |
| j172 | | Jørgen Glomvik Rakke, Marielle Christiansen, Kjetil Fagerholt, Gilbert Laporte: The Traveling Salesman Problem with Draft Limits. Computers & OR 39(9): 2161-2167 (2012) |
| j171 | | Leandro C. Coelho, Jean-François Cordeau, Gilbert Laporte: The inventory-routing problem with transshipment. Computers & OR 39(11): 2537-2548 (2012) |
| j170 | | Glaydston Mattos Ribeiro, Gilbert Laporte, Geraldo Regis Mauri: A comparison of three metaheuristics for the workover rig routing problem. European Journal of Operational Research 220(1): 28-36 (2012) |
| j169 | | Emrah Demir, Tolga Bektas, Gilbert Laporte: An adaptive large neighborhood search heuristic for the Pollution-Routing Problem. European Journal of Operational Research 223(2): 346-359 (2012) |
| j168 | | Éric Duchenne, Gilbert Laporte, Frédéric Semet: The undirected m-Capacitated Peripatetic Salesman Problem. European Journal of Operational Research 223(3): 637-643 (2012) |
| j167 | | Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte: A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem. INFORMS Journal on Computing 24(3): 343-355 (2012) |
| j166 | | Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet: A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem. INFORMS Journal on Computing 24(4): 554-564 (2012) |
| j165 | | Luigi Moccia, Jean-François Cordeau, Gilbert Laporte: An incremental tabu search heuristic for the generalized vehicle routing problem with time windows. JORS 63(2): 232-244 (2012) |
| j164 | | Sabine Limbourg, Michaël Schyns, Gilbert Laporte: Automatic aircraft cargo load planning. JORS 63(9): 1271-1283 (2012) |
| j163 | | Charles Bordenave, Michel Gendreau, Gilbert Laporte: A branch-and-cut algorithm for the preemptive swapping problem. Networks 59(4): 387-399 (2012) |
| j162 | | Oguz Solyali, Jean-François Cordeau, Gilbert Laporte: Robust Inventory Routing Under Demand Uncertainty. Transportation Science 46(3): 327-340 (2012) |
| j161 | | Ivan Contreras, Jean-François Cordeau, Gilbert Laporte: Exact Solution of Large-Scale Hub Location Problems with Multiple Capacity Levels. Transportation Science 46(4): 439-459 (2012) |
| 2011 | ||
| j160 | | Serge Bisaillon, Jean-François Cordeau, Gilbert Laporte, Federico Pasin: A large neighbourhood search heuristic for the aircraft and passenger recovery problem. 4OR 9(2): 139-157 (2011) |
| j159 | | Gilbert Laporte, Marta M. B. Pascoal: Minimum cost path problems with relays. Computers & OR 38(1): 165-173 (2011) |
| j158 | | Alper Murat, Vedat Verter, Gilbert Laporte: A multi-dimensional shooting algorithm for the two-facility location-allocation problem with dense demand. Computers & OR 38(2): 450-463 (2011) |
| j157 | | Jarl Eirik Korsvik, Kjetil Fagerholt, Gilbert Laporte: A large neighbourhood search heuristic for ship routing and scheduling with split loads. Computers & OR 38(2): 474-483 (2011) |
| j156 | | Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte: A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem. Computers & OR 38(8): 1109-1116 (2011) |
| j155 | | Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet: A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants. Computers & OR 38(11): 1534-1542 (2011) |
| j154 | | Hongtao Lei, Gilbert Laporte, Bo Guo: The capacitated vehicle routing problem with stochastic demands and time windows. Computers & OR 38(12): 1775-1783 (2011) |
| j153 | | Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte: An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays. Discrete Applied Mathematics 159(9): 883-895 (2011) |
| j152 | | Ivan Contreras, Jean-François Cordeau, Gilbert Laporte: Stochastic uncapacitated hub location. European Journal of Operational Research 212(3): 518-528 (2011) |
| j151 | | Jean-François Cordeau, Gilbert Laporte, Luigi Moccia, Gregorio Sorrentino: Optimizing yard assignment in an automotive transshipment terminal. European Journal of Operational Research 215(1): 149-160 (2011) |
| j150 | | Burçin Bozkaya, Erhan Erkut, Dan Haight, Gilbert Laporte: Designing New Electoral Districts for the City of Edmonton. Interfaces 41(6): 534-547 (2011) |
| j149 | | Ivan Contreras, Jean-François Cordeau, Gilbert Laporte: Benders Decomposition for Large-Scale Uncapacitated Hub Location. Operations Research 59(6): 1477-1490 (2011) |
| j148 | | Luigi Moccia, Jean-François Cordeau, Gilbert Laporte, Stefan Ropke, Maria Pia Valentini: Modeling and solving a multimodal transportation problem with flexible-time and scheduled services. Networks 57(1): 53-68 (2011) |
| j147 | | Shoshana Anily, Michel Gendreau, Gilbert Laporte: The preemptive swapping problem on a tree. Networks 58(2): 83-94 (2011) |
| j146 | | Ivan Contreras, Jean-François Cordeau, Gilbert Laporte: The Dynamic Uncapacitated Hub Location Problem. Transportation Science 45(1): 18-32 (2011) |
| c4 | | M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte: An Adaptive Large Neighborhood Search Heuristic for a Snow Plowing Problem with Synchronized Routes. INOC 2011: 406-411 |
| 2010 | ||
| j145 | | Charles Bordenave, Michel Gendreau, Gilbert Laporte: Heuristics for the mixed swapping problem. Computers & OR 37(1): 108-114 (2010) |
| j144 | | Alper Murat, Vedat Verter, Gilbert Laporte: A continuous analysis framework for the solution of location-allocation problems with dense demand. Computers & OR 37(1): 123-136 (2010) |
| j143 | | Min Wen, Jean-François Cordeau, Gilbert Laporte, Jesper Larsen: The dynamic multi-period vehicle routing problem. Computers & OR 37(9): 1615-1623 (2010) |
| j142 | | Günes Erdogan, Jean-François Cordeau, Gilbert Laporte: A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem. Discrete Applied Mathematics 158(15): 1599-1614 (2010) |
| j141 | | Géraldine Heilporn, Jean-François Cordeau, Gilbert Laporte: The Delivery Man Problem with time windows. Discrete Optimization 7(4): 269-282 (2010) |
| j140 | | Gerardo Berbeglia, Jean-François Cordeau, Gilbert Laporte: Dynamic pickup and delivery problems. European Journal of Operational Research 202(1): 8-15 (2010) |
| j139 | | Marie-Claude Bolduc, Gilbert Laporte, Jacques Renaud, Fayez F. Boctor: A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars. European Journal of Operational Research 202(1): 122-130 (2010) |
| j138 | | Günes Erdogan, Jean-François Cordeau, Gilbert Laporte: The Attractive Traveling Salesman Problem. European Journal of Operational Research 203(1): 59-69 (2010) |
| j137 | | Gabriel Gutiérrez-Jarpa, Guy Desaulniers, Gilbert Laporte, Vladimir Marianov: A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows. European Journal of Operational Research 206(2): 341-349 (2010) |
| j136 | | Leizer Lima Pinto, Gilbert Laporte: An efficient algorithm for the Steiner Tree Problem with revenue, bottleneck and hop objective functions. European Journal of Operational Research 207(1): 45-49 (2010) |
| j135 | | Gianpaolo Ghiani, Demetrio Laganà, Gilbert Laporte, Francesco Mari: Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions. J. Heuristics 16(2): 211-233 (2010) |
| j134 | | Gilbert Laporte: The Traveling Salesman Problem, the Vehicle Routing Problem, and Their Impact on Combinatorial Optimization. IJSDS 1(2): 82-92 (2010) |
| j133 | | |
| j132 | | |
| j131 | | Kjetil Fagerholt, Gilbert Laporte, I. Norstad: Reducing fuel emissions by optimizing speed on shipping routes. JORS 61(3): 523-529 (2010) |
| j130 | | Günes Erdogan, Erhan Erkut, Armann Ingolfsson, Gilbert Laporte: Scheduling ambulance crews for maximum coverage. JORS 61(4): 543-550 (2010) |
| j129 | | Jarl Eirik Korsvik, Kjetil Fagerholt, Gilbert Laporte: A tabu search heuristic for ship routing and scheduling. JORS 61(4): 594-603 (2010) |
| j128 | | Roberto Baldacci, Enrico Bartolini, Gilbert Laporte: Some applications of the generalized vehicle routing problem. JORS 61(7): 1072-1077 (2010) |
| j127 | | Irina Dumitrescu, Stefan Ropke, Jean-François Cordeau, Gilbert Laporte: The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Math. Program. 121(2): 269-305 (2010) |
| j126 | | |
| j125 | | Jean-François Cordeau, Manuel Iori, Gilbert Laporte, Juan José Salazar González: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1): 46-59 (2010) |
| j124 | | Jean-François Cordeau, Gilbert Laporte, Federico Pasin, Stefan Ropke: Scheduling technicians and tasks in a telecommunications company. J. Scheduling 13(4): 393-409 (2010) |
| j123 | | Gilbert Laporte, Roberto Musmanno, Francesca Vocaturo: An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands. Transportation Science 44(1): 125-135 (2010) |
| j122 | | Maria Battarra, Günes Erdogan, Gilbert Laporte, Daniele Vigo: The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs. Transportation Science 44(3): 383-399 (2010) |
| 2009 | ||
| j121 | | Julie Paquette, Jean-François Cordeau, Gilbert Laporte: Quality of service in dial-a-ride operations. Computers & Industrial Engineering 56(4): 1721-1734 (2009) |
| j120 | | Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte: The capacity and distance constrained plant location problem. Computers & OR 36(2): 597-611 (2009) |
| j119 | | Temel Öncan, I. Kuban Altinel, Gilbert Laporte: A comparative analysis of several asymmetric traveling salesman problem formulations. Computers & OR 36(3): 637-654 (2009) |
| j118 | | Fabien Cornillier, Gilbert Laporte, Fayez F. Boctor, Jacques Renaud: The petrol station replenishment problem with time windows. Computers & OR 36(3): 919-935 (2009) |
| j117 | | Günes Erdogan, Jean-François Cordeau, Gilbert Laporte: The pickup and delivery traveling salesman problem with first-in-first-out loading. Computers & OR 36(6): 1800-1808 (2009) |
| j116 | | Arild Hoff, Irina Gribkovskaia Sr., Gilbert Laporte, Arne Løkketangen: Lasso solution strategies for the vehicle routing problem with pickups and deliveries. European Journal of Operational Research 192(3): 755-766 (2009) |
| j115 | | Souheyl Touhami, Jean-Marie Bourjolly, Gilbert Laporte: Partial integration of frequency allocation within antenna positioning in GSM mobile networks. European Journal of Operational Research 193(2): 541-551 (2009) |
| j114 | | Ardavan Asef-Vaziri, Gilbert Laporte: Integration of operational policies into the design phase of a material handling network. IJAOM 1(1): 108-134 (2009) |
| j113 | | Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte: Scenario Tree-Based Heuristics for Stochastic Inventory-Routing Problems. INFORMS Journal on Computing 21(2): 268-285 (2009) |
| j112 | | Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega, Miguel A. Pozo: Locating a metro line in a historical city centre: application to Sevilla. JORS 60(10): 1462-1466 (2009) |
| j111 | | Min Wen, Jesper Larsen, Jens Clausen, Jean-François Cordeau, Gilbert Laporte: Vehicle routing with cross-docking. JORS 60(12): 1708-1718 (2009) |
| j110 | | Honora K. Smith, Gilbert Laporte, Paul R. Harper: Locational analysis: highlights of growth to maturity. JORS 60(S1) (2009) |
| j109 | | Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte: Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints. Networks 53(2): 141-159 (2009) |
| j108 | | Éric Duchenne, Gilbert Laporte, Frédéric Semet: Heuristiques pour le Problème du Vendeur m-Péripatétique. RAIRO - Operations Research 43(1): 13-26 (2009) |
| j107 | | Teodor Gabriel Crainic, Gilbert Laporte, Vedat Verter: Guest Editorial - Focused Issue on Freight Transportation. Transportation Science 43(2): 127-128 (2009) |
| j106 | | |
| r1 | | François V. Louveaux, Gilbert Laporte: Stochastic Vehicle Routing Problems. Encyclopedia of Optimization 2009: 3829-3832 |
| 2008 | ||
| j105 | | Irina Gribkovskaia Sr., Gilbert Laporte, Aliaksandr Shyshou: The single vehicle routing problem with deliveries and selective pickups. Computers & OR 35(9): 2908-2924 (2008) |
| j104 | | Tolga Bektas, Jean-François Cordeau, Erhan Erkut, Gilbert Laporte: Exact algorithms for the joint object placement and request routing problem in content distribution networks. Computers & OR 35(12): 3860-3884 (2008) |
| j103 | | Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte: Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. European Journal of Operational Research 190(1): 68-78 (2008) |
| j102 | | Fabien Cornillier, Fayez F. Boctor, Gilbert Laporte, Jacques Renaud: A heuristic for the multi-period petrol station replenishment problem. European Journal of Operational Research 191(2): 295-305 (2008) |
| j101 | | Temel Öncan, Jean-François Cordeau, Gilbert Laporte: A tabu search heuristic for the generalized minimum spanning tree problem. European Journal of Operational Research 191(2): 306-319 (2008) |
| j100 | | Jean-François Cordeau, Gilbert Laporte, Federico Pasin: Iterated tabu search for the car sequencing problem. European Journal of Operational Research 191(3): 945-956 (2008) |
| j99 | | H. Neil Geismar, Gilbert Laporte, Lei Lei, Chelliah Sriskandarajah: The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan. INFORMS Journal on Computing 20(1): 21-33 (2008) |
| j98 | | Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(1): 4-18 (2008) |
| j97 | | Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello: Erratum: A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51(2): 153 (2008) |
| 2007 | ||
| j96 | | Jean-François Cordeau, Gilbert Laporte: The dial-a-ride problem: models and algorithms. Annals OR 153(1): 29-46 (2007) |
| j95 | | 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) |
| j94 | | 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) |
| j93 | | 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) |
| j92 | | 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) |
| j91 | | 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) |
| j90 | | 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) |
| j89 | | 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) |
| j88 | | 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) |
| j87 | | Francesco Carrabs, Jean-François Cordeau, Gilbert Laporte: Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading. INFORMS Journal on Computing 19(4): 618-632 (2007) |
| j86 | | Éric Duchenne, Gilbert Laporte, Frédéric Semet: The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms. Operations Research 55(5): 949-965 (2007) |
| j85 | | Abdullah Dasci, Gilbert Laporte: Erratum to "A Continuous Model for Multistore Competitive Location". Operations Research 55(6): 1188-1190 (2007) |
| j84 | | Irina Gribkovskaia Sr., Øyvind Halskau, Gilbert Laporte: The bridges of Königsberg - A historical perspective. Networks 49(3): 199-203 (2007) |
| j83 | | 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) |
| j82 | | 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) |
| j81 | | Gilbert Laporte, Inmaculada Rodríguez Martín: Locating a cycle in a transportation or a telecommunications network. Networks 50(1): 92-108 (2007) |
| j80 | | Claudia Archetti, Luca Bertazzi, Gilbert Laporte, Maria Grazia Speranza: A Branch-and-Cut Algorithm for a Vendor-Managed Inventory-Routing Problem. Transportation Science 41(3): 382-391 (2007) |
| 2006 | ||
| j79 | | Jean-François Cordeau, Manlio Gaudioso, Gilbert Laporte, Luigi Moccia: A Memetic Heuristic for the Generalized Quadratic Assignment Problem. INFORMS Journal on Computing 18(4): 433-443 (2006) |
| j78 | | Gianpaolo Ghiani, Gilbert Laporte, Frédéric Semet: The Black and White Traveling Salesman Problem. Operations Research 54(2): 366-378 (2006) |
| j77 | | Michel Gendreau, Manuel Iori, Gilbert Laporte, Silvano Martello: A Tabu Search Algorithm for a Routing and Container Loading Problem. Transportation Science 40(3): 342-350 (2006) |
| j76 | | Lars Magnus Hvattum, Arne Løkketangen, Gilbert Laporte: Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic. Transportation Science 40(4): 421-438 (2006) |
| 2005 | ||
| j75 | | |
| j74 | | Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega, Ignacio Sevillano: Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment. Annals OR 136(1): 49-63 (2005) |
| j73 | | 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) |
| j72 | | É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) |
| j71 | | Ardavan Asef-Vaziri, Gilbert Laporte: Loop based facility planning and material handling. European Journal of Operational Research 164(1): 1-11 (2005) |
| j70 | | Abdullah Dasci, Gilbert Laporte: A Continuous Model for Multistore Competitive Location. Operations Research 53(2): 263-280 (2005) |
| j69 | | 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) |
| j68 | | Jean-François Cordeau, Gilbert Laporte, Pasquale Legato, Luigi Moccia: Models and Tabu Search Heuristics for the Berth-Allocation Problem. Transportation Science 39(4): 526-538 (2005) |
| 2004 | ||
| j67 | | 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) |
| j66 | | 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) |
| j65 | | 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) |
| j64 | | Gianpaolo Ghiani, Francesca Guerriero, Gilbert Laporte, Roberto Musmanno: Tabu Search Heuristics for the Arc Routing Problem with Intermediate Facilities under Capacity and Length Restrictions. J. Math. Model. Algorithms 3(3): 209-223 (2004) |
| j63 | | 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) |
| j62 | | 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) |
| j61 | | |
| j60 | | 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) |
| c3 | | 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 |
| 2003 | ||
| j59 | | Jean-François Cordeau, Gilbert Laporte: The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms. 4OR 1(2): 89-101 (2003) |
| j58 | | 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) |
| j57 | | Fayez F. Boctor, Gilbert Laporte, Jacques Renaud: Heuristics for the traveling purchaser problem. Computers & OR 30(4): 491-504 (2003) |
| j56 | | 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) |
| j55 | | Luce Brotcorne, Gilbert Laporte, Frédéric Semet: Ambulance location and relocation models. European Journal of Operational Research 147(3): 451-463 (2003) |
| j54 | | Corinne Feremans, Martine Labbé, Gilbert Laporte: Generalized network design problems. European Journal of Operational Research 148(1): 1-13 (2003) |
| j53 | | 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) |
| j52 | | 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) |
| j51 | | Gilbert Laporte, Jorge Riera-Ledesma, Juan José Salazar González: A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem. Operations Research 51(6): 940-951 (2003) |
| j50 | | Gilbert Laporte, Roberto Musmanno: Parallel computing in logistics. Parallel Computing 29(5): 553-554 (2003) |
| j49 | | 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) |
| 2002 | ||
| j48 | | Abdullah Dasci, Horst A. Eiselt, Gilbert Laporte: On the (r|Xp)-Medianoid Problem on a Network with Vertex and Edge Demands. Annals OR 111(1-4): 271-278 (2002) |
| j47 | | Giuseppe Bruno, Michel Gendreau, Gilbert Laporte: A heuristic for the location of a rapid transit line. Computers & OR 29(1): 1-12 (2002) |
| j46 | | Luce Brotcorne, Gilbert Laporte, Frédéric Semet: Fast heuristics for large scale covering-location problems. Computers & OR 29(6): 651-665 (2002) |
| j45 | | Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega: Locating stations on rapid transit lines. Computers & OR 29(6): 741-759 (2002) |
| j44 | | Jacques Renaud, Fayez F. Boctor, Gilbert Laporte: Perturbation heuristics for the pickup and delivery traveling salesman problem. Computers & OR 29(9): 1129-1141 (2002) |
| j43 | | Jean-Marie Bourjolly, Gilbert Laporte, Gilles Pesant: An exact algorithm for the maximum k-club problem in an undirected graph. European Journal of Operational Research 138(1): 21-28 (2002) |
| j42 | | Gilbert Laporte, François V. Louveaux, Luc van Hamme: An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands. Operations Research 50(3): 415-423 (2002) |
| j41 | | 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 | ||
| j40 | | Martine Labbé, Gilbert Laporte, Silvano Martello: Preface. Discrete Applied Mathematics 112(1-3): 1 (2001) |
| j39 | | Michel Gendreau, Gilbert Laporte, Eduardo Morais Guimarães: A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times. European Journal of Operational Research 133(1): 183-189 (2001) |
| j38 | | Corinne Feremans, Martine Labbé, Gilbert Laporte: On generalized minimum spanning trees. European Journal of Operational Research 134(2): 457-458 (2001) |
| j37 | | Gianpaolo Ghiani, Gennaro Improta, Gilbert Laporte: The capacitated arc routing problem with intermediate facilities. Networks 37(3): 134-143 (2001) |
| j36 | | 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 | ||
| j35 | | 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) |
| j34 | | Jean-Marie Bourjolly, Gilbert Laporte, Gilles Pesant: Heuristics for finding k-clubs in an undirected graph. Computers & OR 27(6): 559-569 (2000) |
| j33 | | Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega: Optimization methods for the planning of rapid transit systems. European Journal of Operational Research 122(1): 1-10 (2000) |
| 1999 | ||
| j32 | | Michel Gendreau, Gilbert Laporte, Daniele Vigo: Heuristics for the traveling salesman problem with pickup and delivery. Computers & OR 26(7): 699-714 (1999) |
| j31 | | 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) |
| j30 | | Corinne Feremans, Martine Labbé, Gilbert Laporte: The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut. Electronic Notes in Discrete Mathematics 3: 45-50 (1999) |
| j29 | | Gilbert Laporte, Frédéric Semet: An optimality cut for mixed integer linear programs. European Journal of Operational Research 119(3): 671-677 (1999) |
| j28 | | Alain Hertz, Gilbert Laporte, Pierrette Nanchen Hugo: Improvement Procedures for the Undirected Rural Postman Problem. INFORMS Journal on Computing 11(1): 53-62 (1999) |
| j27 | | |
| j26 | | Shoshana Anily, Michel Gendreau, Gilbert Laporte: The Swapping Problem on a Line. SIAM J. Comput. 29(1): 327-335 (1999) |
| 1998 | ||
| j25 | | Martine Labbé, Gilbert Laporte, Patrick Soriano: Covering a graph with cycles. Computers & OR 25(6): 499-504 (1998) |
| j24 | | 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 | ||
| j23 | | 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) |
| j22 | | Gilbert Laporte: Modeling and solving several classes of arc routing problems as traveling salesman problems. Computers & OR 24(11): 1057-1061 (1997) |
| j21 | | 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) |
| j20 | | 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) |
| c2 | | Michael W. Carter, Gilbert Laporte: Recent Developments in Practical Course Timetabling. PATAT 1997: 3-19 |
| 1996 | ||
| j19 | | 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) |
| j18 | | Michel Gendreau, Alain Hertz, Gilbert Laporte: The Traveling Salesman Problem with Backhauls. Computers & OR 23(5): 501-508 (1996) |
| j17 | | Jacques Renaud, Fayez F. Boctor, Gilbert Laporte: A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem. INFORMS Journal on Computing 8(2): 134-143 (1996) |
| j16 | | 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 | ||
| j15 | | Michel Gendreau, Martine Labbé, Gilbert Laporte: Efficient heuristics for the design of ring networks. Telecommunication Systems 4(1): 177-188 (1995) |
| j14 | | Michel Gendreau, Gilbert Laporte, Marius M. Solomon: Single-Vehicle Routing and Scheduling to Minimize the Number of Delays. Transportation Science 29(1): 56-62 (1995) |
| j13 | | Michel Gendreau, Gilbert Laporte, René Séguin: An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers. Transportation Science 29(2): 143-155 (1995) |
| j12 | | Paulo M. França, Michel Gendreau, Gilbert Laporte, Felipe Martins Müller: The m-Traveling Salesman Problem with Minmax Objective. Transportation Science 29(3): 267-275 (1995) |
| c1 | | Michael W. Carter, Gilbert Laporte: Recent Developments in Practical Examination Timetabling. PATAT 1995: 3-21 |
| 1994 | ||
| j11 | | 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) |
| j10 |  | Moshe Dror, Gilbert Laporte, Pierre Trudeau: Vehicle routing with split deliveries. Discrete Applied Mathematics 50(3): 239-254 (1994) |
| 1993 | ||
| j9 | | Véronique Lambert, Gilbert Laporte, François V. Louveaux: Designing collection routes through bank branches. Computers & OR 20(7): 783-791 (1993) |
| j8 | | Moshe Dror, Gilbert Laporte, François V. Louveaux: Vehicle routing with stochastic demands and restricted failures. Math. Meth. of OR 37(3): 273-283 (1993) |
| 1992 | ||
| j7 | | Horst A. Eiselt, Michel Gendreau, Gilbert Laporte: Location of facilities on a network subject to a single-edge failure. Networks 22(3): 231-246 (1992) |
| 1990 | ||
| j6 | | Gilbert Laporte, Silvano Martello: The selective travelling salesman problem. Discrete Applied Mathematics 26(2-3): 193-207 (1990) |
| 1988 | ||
| j5 | | Jacques Desrosiers, Gilbert Laporte, Michel Sauve, François Soumis, Serge Taillefer: Vehicle routing with full loads. Computers & OR 15(3): 219-226 (1988) |
| 1986 | ||
| j4 | | Gilbert Laporte, Sylvain Desroches: The problem of assigning students to course sections in a large engineering school. Computers & OR 13(4): 387-394 (1986) |
| j3 | | Gilbert Laporte, Hélène Mercure, Yves Nobert: An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16(1): 33-46 (1986) |
| 1984 | ||
| j2 | | Gilbert Laporte, Sylvain Desroches: Examination timetabling by computer. Computers & OR 11(4): 351-360 (1984) |
| j1 | | Gilbert Laporte, Martin Desrochers, Yves Nobert: Two exact algorithms for the distance-constrained vehicle routing problem. Networks 14(1): 161-172 (1984) |
Colors in the list of coauthors
Last update Mon May 20 02:16:42 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page