The following pages link to Gilbert Laporte (Q203167):
Displayed 50 items.
- Planning models for freight transportation (Q1278638) (← links)
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem (Q1302554) (← links)
- Heuristics for the traveling salesman problem with pickup and delivery (Q1302721) (← links)
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective (Q1318519) (← links)
- Vehicle routing with split deliveries (Q1327209) (← links)
- A generalized insertion algorithm for the seriation problem (Q1328867) (← links)
- Optimal location of facilities on a network with an unreliable node or link (Q1350200) (← links)
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective (Q1362944) (← links)
- Assessing the efficiency of rapid transit configurations (Q1367693) (← links)
- Modeling and solving several classes of arc routing problems as traveling salesman problems (Q1374032) (← links)
- A combinatorial column generation algorithm for the maximum stable set problem (Q1374381) (← links)
- Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594) (← links)
- Scheduling and lot streaming in flowshops with no-wait in process (Q1404270) (← links)
- Covering a graph with cycles. (Q1406651) (← links)
- Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. (Q1406947) (← links)
- Solving the hierarchical Chinese postman problem as a rural postman problem. (Q1428044) (← links)
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms (Q1432014) (← links)
- A branch-and-cut algorithm for the undirected rural postman problem (Q1575070) (← links)
- An exact algorithm for the maximum \(k\)-club problem in an undirected graph (Q1600883) (← links)
- Perturbation heuristics for the pickup and delivery traveling salesman problem (Q1603311) (← links)
- A tabu search heuristic for the undirected selective travelling salesman problem (Q1609914) (← links)
- The green mixed fleet vehicle routing problem with partial battery recharging and time windows (Q1628058) (← links)
- An adaptive large neighborhood search for the discrete and continuous berth allocation problem (Q1651633) (← links)
- The pickup and delivery problem with time windows and handling operations (Q1652028) (← links)
- Vehicle routing with cross-dock selection (Q1652043) (← links)
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem (Q1652047) (← links)
- Multi-objective rapid transit network design with modal competition: the case of Concepción, Chile (Q1652050) (← links)
- A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
- Vessel routing with pickups and deliveries: an application to the supply of offshore oil platforms (Q1652157) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time (Q1652375) (← links)
- Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs (Q1652405) (← links)
- Corridor-based metro network design with travel flow capture (Q1652444) (← links)
- Vehicle routing with backhauls: review and research perspectives (Q1652540) (← links)
- The periodic supply vessel planning problem with flexible departure times and coupled vessels (Q1652603) (← links)
- Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities (Q1681274) (← links)
- The static bike relocation problem with multiple vehicles and visits (Q1681499) (← links)
- The multi-vehicle cumulative covering tour problem (Q1686527) (← links)
- Continuous approximation models in freight distribution management (Q1688432) (← links)
- Rejoinder on: continuous approximation models in freight distribution management (Q1688434) (← links)
- Resource constrained routing and scheduling: review and research prospects (Q1694813) (← links)
- A vehicle routing problem arising in unmanned aerial monitoring (Q1722956) (← links)
- Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions (Q1725617) (← links)
- Shared mobility systems: an updated survey (Q1730532) (← links)
- An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows (Q1734348) (← links)
- Median and covering location problems with interconnected facilities (Q1738812) (← links)
- Electric vehicle routing problem with time-dependent waiting times at recharging stations (Q1738821) (← links)
- A two-echelon inventory routing problem for perishable products (Q1738829) (← links)
- A metaheuristic for the time-dependent pollution-routing problem (Q1751914) (← links)
- Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)