Laporte, Gilbert.
![Sudoc [ABES], France](/viaf/images/flags/SUDOC.png "Sudoc [ABES], France")
Laporte, Gilbert, 1950-
VIAF ID: 81080327 (Personal)
Permalink: http://viaf.org/viaf/81080327
Preferred Forms
-
100 1 _ ‡a Laporte, Gilbert
-
100 1 _ ‡a Laporte, Gilbert
-
100 1 _ ‡a Laporte, Gilbert
-
100 1 _
‡a
Laporte, Gilbert
-
100 1 _
‡a
Laporte, Gilbert
-
100 1 _ ‡a Laporte, Gilbert ‡d 1950-
-
100 1 _ ‡a Laporte, Gilbert ‡d 1950-
-
100 1 _ ‡a Laporte, Gilbert, ‡d 1950-
-
100 1 _
‡a
Laporte, Gilbert,
‡d
1950-
-
100 1 _ ‡a Laporte, Gilbert.
4xx's: Alternate Name Forms (4)
Works
| Title | Sources |
|---|---|
| An Algorithm for the design of mailbox collection routes in urban areas |
|
| Applications du graphisme par ordinateur, c1984: |
|
| A branch-and-cut algorithm for the undirected rural postman problem |
|
| Classical heuristics for the vehicle routing problem |
|
| A Combinatorial optimization problem arising in dart board design |
|
| Competitive spatial models |
|
| Consistency in multi-vehicle inventory-routing |
|
| La construction d'horaires de travail |
|
| Covering a graph with cycles |
|
| A covering tour model for planning mobile health care facilities in Suhum District, Ghana |
|
| Découpage électoral automatisé : application à l'île de Montréal |
|
| Designing collection routes through bank branches |
|
| Dynamic and stochastic inventory-routing |
|
| Efficient heuristics for the design of ring networks |
|
| Equilibrium conditions for the 3-facility Hotelling model in a tree |
|
| An exact algorithm for minimizing delivery and operating costs in depot location |
|
| Expected distances between two random points in rectangles and rectangular parallelepipeds |
|
| Finding the shortest Hamiltonian circuit through n clusters : a Lagrangean relaxation approach |
|
| Fleet management and logistics |
|
| Handbooks in operations research and management science |
|
| Heuristics for finding k-clubs in an undirected graph |
|
| Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints |
|
| The Integer L-shaped method for stochastic integer programs with complete recourse |
|
| Introduction to logistics systems planning and control |
|
| The inventory-routing problem with transshipment |
|
| Locating postal relay boxes using a set covering algorithm |
|
| Location of a new facility on a linear market in the presence of weights |
|
| Location Science |
|
| Maximizing pedestrian flow in shopping center layout |
|
| Models and exact solutions for a class of stochastic location-routing problems |
|
| New insertion and post-optimization procedures for the traveling salesman problem |
|
| Optimal sequencing rules for some large scale flexible manufacturing problems under the Manhattan and Chebychev metrics |
|
| Optimal tour planning with specified nodes |
|
| The periodic supply vessel planning problem with flexible departure times and coupled vessels |
|
| Perspectives on multiobjective transportation planning |
|
| Planning rapid transit networks |
|
| The preemptive swapping problem on a tree |
|
| Probabilites et statistique : theorie et problemes resolus |
|
| Recent advances in routing algorithms |
|
| Routing and scheduling within a job shop framework |
|
| Selected readings on vehicle routing |
|
| A simple enhancement of the Esau-Williams heuristic for the capacitated minimum spanning tree problem |
|
| Solving a family of multi-depot vehicle routing and location-routing problems |
|
| Solving arc routing problems with turn penalties |
|
| Some applications of the generalized traveling salesman problem |
|
| Some further results on k-star constraints and comb inequalities |
|
| Stability metrics for a maritime inventory routing problem under sailing time uncertainty |
|
| Supply vessel planning under cost, environment and robustness considerations |
|
| Supply vessel routing and scheduling under uncertain demand |
|
| A tabu search heuristic for political districting |
|
| Théorie de la décision |
|
| Thirty years of inventory-routing |
|
| A tiling and routing heuristic for the screening of cytological samples |
|
| The tube challenge |
|
| Upper bounds and algorithms for the maximum cardinality bin packing problem |
|
| The Use of domains in multicriteria decision making |
|
| A Vehicle flow model for the optimal design of a two-echelon distribution system |
|
| Vehicle routing with stochastic demands and restricted failures |
|
