Laporte Gilbert

Gilbert Laporte

Information about the author Gilbert Laporte will soon be added to the site.
Found 203 papers in total
Generalized network design problems
Generalized network design problems
2003
Network design problems (NDP) consist of identifying an optimal subgraph of a graph,...
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
2004
This article presents a branch-and-cut algorithm for the Generalized Minimum Spanning...
A tabu search heuristic and adaptive memory procedure for political districting
A tabu search heuristic and adaptive memory procedure for political districting
2003
In political districting problems, the aim is to partition a territory into electoral...
Heuristics for the traveling purchaser problem
Heuristics for the traveling purchaser problem
2003
This article deals with two versions of the traveling purchaser problem. In the...
An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands
An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands
2002
The classical Vehicle Routing Problem consists of determining optimal routes for m...
On the (r|Xp)-medianoid problem on a network with vertex and edge demands
On the (r|Xp)-medianoid problem on a network with vertex and edge demands
2002
This article considers the (r|X p ) -medianoid problem on a network N = (V, E)...
Heuristics for the black and white traveling salesman problem
Heuristics for the black and white traveling salesman problem
2003
The black and white traveling salesman problem (BWTSP) is defined on a graph G whose...
A simple enhancement of the Esau–Williams heuristic for the capacitated minimum spanning tree problem
A simple enhancement of the Esau–Williams heuristic for the capacitated minimum spanning tree problem
2002
The Esau–Williams algorithm is one of the best known heuristics for the...
A comparative analysis of several formulations for the generalized minimum spanning tree problem
A comparative analysis of several formulations for the generalized minimum spanning tree problem
2002
This article describes eight formulations for the Generalized Minimum Spanning Tree...
Some applications of the clustered travelling salesman problem
Some applications of the clustered travelling salesman problem
2002
The purpose of this article is to describe several applications of the clustered...
A guide to vehicle routing heuristics
A guide to vehicle routing heuristics
2002
Several of the most important classical and modern heuristics for the vehicle routing...
Perturbation heuristics for the pickup and delivery traveling salesman problem
Perturbation heuristics for the pickup and delivery traveling salesman problem
2002
This article describes and compares seven perturbation heuristics for the Pickup and...
Locating stations on rapid transit lines
Locating stations on rapid transit lines
2002
When the alignment of a new line or section of a line of a rapid transit system has...
An exact algorithm for the maximum k-club problem in an undirected graph
An exact algorithm for the maximum k-club problem in an undirected graph
2002
In this paper, we prove that the maximum k -club problem (M k CP) defined on an...
The capacitated arc routing problem with intermediate facilities
The capacitated arc routing problem with intermediate facilities
2001
This article introduces the Capacitated Arc Routing with Intermediate Facilities...
Fast heuristics for large scale covering-location problems
Fast heuristics for large scale covering-location problems
2002
We propose fast heuristics for large-scale covering-location problems in which the set...
A heuristic for the location of a rapid transit line
A heuristic for the location of a rapid transit line
2002
This article presents a mathematical model and a two-phase heuristic for the location...
A branch-and-cut algorithm for the undirected selective traveling salesman problem
A branch-and-cut algorithm for the undirected selective traveling salesman problem
1998
The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits...
Eulerian location problems
Eulerian location problems
1999
The problem of locating a set of depots in an arc routing context (with no side...
A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
2001
This article proposes lower bounds, as well as a divide and merge heuristic for the...
A tabu search heuristic for periodic and multi-depot vehicle routing problems
A tabu search heuristic for periodic and multi-depot vehicle routing problems
1997
We propose a tabu search heuristic capable of solving three well-known routing...
On generalized minimum spanning trees
On generalized minimum spanning trees
2001
The generalized minimum spanning tree problem consists of designing a minimum cost...
The uncapacitated facility location problem with client matching
The uncapacitated facility location problem with client matching
2000
The Uncapacitated Facility Location Problem with Client Matching (LCM) is an extension...
Assessing the efficiency of rapid transit configurations
Assessing the efficiency of rapid transit configurations
1997
Eight basic transit network configurations are analyzed with respect to two measures:...
Papers per page: