The following pages link to G. Laporte (Q203167):
Displaying 50 items.
- Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times (Q1754111) (← links)
- Multi-level facility location problems (Q1754251) (← links)
- The traveling salesman problem with draft limits (Q1761142) (← links)
- The inventory-routing problem with transshipment (Q1761192) (← links)
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031) (← links)
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs (Q1762084) (← links)
- Synchronized arc routing for snow plowing operations (Q1762132) (← links)
- Heuristics and lower bounds for the bin packing problem with conflicts (Q1765544) (← links)
- An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling (Q1782149) (← links)
- Route and speed optimization for autonomous trucks (Q1782162) (← links)
- An optimality cut for mixed integer linear programs (Q1809846) (← links)
- Generalized network design problems. (Q1810478) (← links)
- Heuristics for the multi-vehicle covering tour problem (Q1818567) (← links)
- A tabu search heuristic and adaptive memory procedure for political districting (Q1869686) (← links)
- Heuristics for the black and white traveling salesman problem (Q1869887) (← links)
- Heuristics for the traveling purchaser problem (Q1870801) (← links)
- On the (\(r|X_p\))-medianoid problem on a network with vertex and edge demands (Q1872040) (← links)
- Ambulance location and relocation models. (Q1872997) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- An exact algorithm for the dual bin packing problem (Q1892657) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The traveling salesman problem with backhauls (Q1915968) (← links)
- A tabu search heuristic for the multi-depot vehicle routing problem (Q1919200) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times (Q1935881) (← links)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
- Optimization methods for the planning of rapid transit systems (Q1971985) (← links)
- Heuristics for finding \(k\)-clubs in an undirected graph (Q1977620) (← links)
- The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
- Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks (Q2030659) (← links)
- A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
- The target visitation arc routing problem (Q2121609) (← links)
- Transport of skips between recycling centers and treatment facilities (Q2147169) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- Counting and enumerating feasible rotating schedules by means of Gröbner bases (Q2228806) (← links)
- Inbound and outbound flow integration for cross-docking operations (Q2240064) (← links)
- Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions (Q2242377) (← links)
- An adaptive large neighborhood search heuristic for the pollution-routing problem (Q2253352) (← links)
- The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380) (← links)
- Rich routing problems arising in supply chain management (Q2253448) (← links)
- The bi-objective pollution-routing problem (Q2255967) (← links)
- Exact formulations and algorithm for the train timetabling problem with dynamic demand (Q2257347) (← links)
- Dynamic transportation of patients in hospitals (Q2267375) (← links)
- A districting-based heuristic for the coordinated capacitated arc routing problem (Q2273678) (← links)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891) (← links)
- Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer (Q2329718) (← links)
- Crowd-shipping with time windows and transshipment nodes (Q2333154) (← links)
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
- Facility location problems with user cooperation (Q2421328) (← links)
