AAAAAA

   
Results: 1-25 | 26-30
Results: 1-25/30
A heuristic for the location of a rapid transit line
Authors: Bruno, G Gendreau, M Laporte, G
Citation: G. Bruno et al., A heuristic for the location of a rapid transit line, COMPUT OPER, 29(1), 2002, pp. 1-12
Combinatorial optimization symposium - Preface
Authors: Labbe, M Laporte, G Martello, S
Citation: M. Labbe et al., Combinatorial optimization symposium - Preface, DISCR APP M, 112(1-3), 2001, pp. 1-1
A tabu search algorithm for the site dependent vehicle routing problem with time windows
Authors: Cordeau, JF Laporte, G
Citation: Jf. Cordeau et G. Laporte, A tabu search algorithm for the site dependent vehicle routing problem with time windows, INFOR, 39(3), 2001, pp. 292-298
A dynamic model and parallel tabu search heuristic for real-time ambulancerelocation
Authors: Gendreau, M Laporte, G Semet, F
Citation: M. Gendreau et al., A dynamic model and parallel tabu search heuristic for real-time ambulancerelocation, PARALLEL C, 27(12), 2001, pp. 1641-1653
A unified tabu search heuristic for vehicle routing problems with time windows
Authors: Cordeau, JF Laporte, G Mercier, A
Citation: Jf. Cordeau et al., A unified tabu search heuristic for vehicle routing problems with time windows, J OPER RES, 52(8), 2001, pp. 928-936
Solving arc routing problems with turn penalties
Authors: Clossey, J Laporte, G Soriano, P
Citation: J. Clossey et al., Solving arc routing problems with turn penalties, J OPER RES, 52(4), 2001, pp. 433-439
The capacitated arc routing problem with intermediate facilities
Authors: Ghiani, G Improta, G Laporte, G
Citation: G. Ghiani et al., The capacitated arc routing problem with intermediate facilities, NETWORKS, 37(3), 2001, pp. 134-143
Heuristics for the location of inspection stations on a network
Authors: Gendreau, M Laporte, G Parent, I
Citation: M. Gendreau et al., Heuristics for the location of inspection stations on a network, NAV RES LOG, 47(4), 2000, pp. 287-303
The block layout shortest loop design problem
Authors: Asef-Vaziri, A Laporte, G Sriskandarajah, C
Citation: A. Asef-vaziri et al., The block layout shortest loop design problem, IIE TRANS, 32(8), 2000, pp. 727-734
Heuristics for finding k-clubs in an undirected graph
Authors: Bourjolly, JM Laporte, G Pesant, G
Citation: Jm. Bourjolly et al., Heuristics for finding k-clubs in an undirected graph, COMPUT OPER, 27(6), 2000, pp. 559-569
Heuristics for the multi-vehicle covering tour problem
Authors: Hachicha, M Hodgson, MJ Laporte, G Semet, F
Citation: M. Hachicha et al., Heuristics for the multi-vehicle covering tour problem, COMPUT OPER, 27(1), 2000, pp. 29-42
The uncapacitated facility location problem with client matching
Authors: Gourdin, E Labbe, M Laporte, G
Citation: E. Gourdin et al., The uncapacitated facility location problem with client matching, OPERAT RES, 48(5), 2000, pp. 671-685
A tabu search heuristic for the capacitated arc routing problem
Authors: Hertz, A Laporte, G Mittaz, M
Citation: A. Hertz et al., A tabu search heuristic for the capacitated arc routing problem, OPERAT RES, 48(1), 2000, pp. 129-135
A branch-and-cut algorithm for the Undirected Rural Postman Problem
Authors: Ghiani, G Laporte, G
Citation: G. Ghiani et G. Laporte, A branch-and-cut algorithm for the Undirected Rural Postman Problem, MATH PROGR, 87(3), 2000, pp. 467-481
Improvement procedures for the undirected rural postman problem
Authors: Hertz, A Laporte, G Hugo, PN
Citation: A. Hertz et al., Improvement procedures for the undirected rural postman problem, INFORMS J C, 11(1), 1999, pp. 53-62
Two exact algorithms for the vehicle routing problem on trees
Authors: Mbaraga, P Langevin, A Laporte, G
Citation: P. Mbaraga et al., Two exact algorithms for the vehicle routing problem on trees, NAV RES LOG, 46(1), 1999, pp. 75-89
Special issue of INFOR on metaheuristics for location and routing problems
Authors: Laporte, G Semet, F
Citation: G. Laporte et F. Semet, Special issue of INFOR on metaheuristics for location and routing problems, INFOR, 37(3), 1999, pp. 193-193
Computational evaluation of a transformation procedure for the symmetric Generalized Traveling Salesman Problem
Authors: Laporte, G Semet, F
Citation: G. Laporte et F. Semet, Computational evaluation of a transformation procedure for the symmetric Generalized Traveling Salesman Problem, INFOR, 37(2), 1999, pp. 114-120
Heuristics for the traveling salesman problem with pickup and delivery
Authors: Gendreau, M Laporte, G Vigo, D
Citation: M. Gendreau et al., Heuristics for the traveling salesman problem with pickup and delivery, COMPUT OPER, 26(7), 1999, pp. 699-714
A tabu search heuristic for the heterogeneous fleet vehicle routing problem
Authors: Gendreau, M Laporte, G Musaraganyi, C Taillard, ED
Citation: M. Gendreau et al., A tabu search heuristic for the heterogeneous fleet vehicle routing problem, COMPUT OPER, 26(12), 1999, pp. 1153-1173
Market capture models under various customer-choice rules
Authors: Serra, D Eiselt, HA Laporte, G ReVelle, CS
Citation: D. Serra et al., Market capture models under various customer-choice rules, ENVIR PL-B, 26(5), 1999, pp. 741-750
An emergency vehicle dispatching system for an electric utility in Chile
Authors: Weintraub, A Aboud, J Fernandez, C Laporte, G Ramirez, E
Citation: A. Weintraub et al., An emergency vehicle dispatching system for an electric utility in Chile, J OPER RES, 50(7), 1999, pp. 690-696
The art and science of designing rotating schedules
Authors: Laporte, G
Citation: G. Laporte, The art and science of designing rotating schedules, J OPER RES, 50(10), 1999, pp. 1011-1017
The swapping problem on a line
Authors: Anily, S Gendreau, M Laporte, G
Citation: S. Anily et al., The swapping problem on a line, SIAM J COMP, 29(1), 1999, pp. 327-335
Eulerian location problems
Authors: Ghiani, G Laporte, G
Citation: G. Ghiani et G. Laporte, Eulerian location problems, NETWORKS, 34(4), 1999, pp. 291-302
Risultati: 1-25 | 26-30