Laporte Gilbert

Gilbert Laporte

Information about the author Gilbert Laporte will soon be added to the site.
Found 203 papers in total
Steiner tree problems with profits
Steiner tree problems with profits
2006
This is a survey of the Steiner tree problem with profits, a variation of the...
A branch-and-cut algorithm for the undirected traveling purchaser problem
A branch-and-cut algorithm for the undirected traveling purchaser problem
2003
The purpose of this paper is to present a branch-and-cut algorithm for the undirected...
A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal
2006
The quay crane scheduling problem consists of determining a sequence of unloading and...
Models and tabu search heuristics for the berth-allocation problem
Models and tabu search heuristics for the berth-allocation problem
2005
In the Berth-Allocation Problem (BAP) the aim is to optimally schedule and assign...
Scheduling and lot streaming in two-machine open shops with no-wait in process
Scheduling and lot streaming in two-machine open shops with no-wait in process
2005
We study the problem of minimizing the makespan in no-wait two-machine open shops...
Maximizing the value of an Earth observation satellite orbit
Maximizing the value of an Earth observation satellite orbit
2005
Earth observation satellites are platforms equipped with optical instruments that...
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
2004
In the Dial-a-Ride problem (DARP) users specify transportation requests between...
Loop based facility planning and material handling
Loop based facility planning and material handling
2005
A sizeable proportion of manufacturing expenses can be attributed to facility layout...
The Weber problem in a multi-storey building
The Weber problem in a multi-storey building
2005
The multi-storey building is an architectural type whose structure contains ramps,...
Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem
2005
In the m -Peripatetic Salesman Problem ( m -PSP) the aim is to determine m edge...
A practical exact algorithm for the shortest loop design problem in a block layout
A practical exact algorithm for the shortest loop design problem in a block layout
2005
The problem of determining a shortest loop incident to each cell of a block layout is...
Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem
2004
In the Dial-a-Ride problem (DARP) users specify transportation requests between...
Efficient neighborhood search for the probabalistic pickup and delivery travelling salesman problem
Efficient neighborhood search for the probabalistic pickup and delivery travelling salesman problem
2005
In this article the probabilistic pickup and delivery travelling salesman problem is...
Maximizing trip coverage in the location of a single rapid transit alignment
Maximizing trip coverage in the location of a single rapid transit alignment
2005
This article describes several heuristics for the construction of a rapid transit...
Locating median cycles in networks
Locating median cycles in networks
2005
In the median cycle problem the aim is to determine a simple cycle through a subset of...
A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem
A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem
2004
Corrected Miller–Tucker–Zemlin type subtour elimination constraints for...
Solving the hierarchical Chinese postman problem as a rural postman problem
Solving the hierarchical Chinese postman problem as a rural postman problem
2004
In the undirected hierarchical Chinese postman problem (HCPP), the edges of a graph...
Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
Tabu search heuristics for the arc routing problem with intermediate facilities under capacity and length restrictions
2004
This paper deals with the Arc Routing Problem with Intermediate Facilities under...
Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies
Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies
2003
In real-time fleet management, vehicle routes are built in an on-going fashion as...
Upper bounds and algorithms for the maximum cardinality bin packing problem
Upper bounds and algorithms for the maximum cardinality bin packing problem
2003
In the maximum cardinality bin packing problem, we are given m bins of capacity c and...
Heuristics and lower bounds for the bin packing problem with conflicts
Heuristics and lower bounds for the bin packing problem with conflicts
2004
In the bin packing problem with conflicts, the aim is to pack items into the minimum...
The Ring Star problem: polyhedral analysis and exact algorithm
The Ring Star problem: polyhedral analysis and exact algorithm
2004
In the Ring Star Problem, the aim is to locate a simple cycle through a subset of...
Ambulance location and relocation models
Ambulance location and relocation models
2003
This article traces the evolution of ambulance location and relocation models proposed...
Solving a home-care districting problem in an urban setting
Solving a home-care districting problem in an urban setting
2003
This article describes a districting study undertaken for the Côte-des-Neiges...
Papers per page: