The following pages link to Michel Gendreau (Q203166):
Displaying 50 items.
- Operational transportation planning of freight forwarding companies in horizontal coalitions (Q296641) (← links)
- Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
- The traveling salesman problem with time-dependent service times (Q320683) (← links)
- A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times (Q320872) (← links)
- Maintenance scheduling in the electricity industry: a literature review (Q322753) (← links)
- Accelerating Benders decomposition for closed-loop supply chain network design: case of used durable products with different quality levels (Q322784) (← links)
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization (Q323288) (← links)
- An adaptive evolutionary approach for real-time vehicle routing and dispatching (Q336366) (← links)
- An adaptive large neighborhood search for a vehicle routing problem with multiple routes (Q336781) (← links)
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
- Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm (Q337247) (← links)
- A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
- A heuristic to solve the synchronized log-truck scheduling problem (Q340226) (← links)
- Lower bounds and exact algorithms for the quadratic minimum spanning tree problem (Q342052) (← links)
- Time-dependent routing problems: a review (Q342083) (← links)
- A 2-stage method for a field service routing problem with stochastic travel and service times (Q342116) (← links)
- Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
- A hybrid constraint programming approach to the log-truck scheduling problem (Q545549) (← links)
- A note on branch-and-cut-and-price (Q613321) (← links)
- Topology-aware wavelength partitioning for DWDM OBS networks: a novel approach for absolute QoS provisioning (Q621048) (← links)
- A heuristic method for non-homogeneous redundancy optimization of series-parallel multi-state systems (Q623310) (← links)
- The orienteering problem with stochastic travel and service times (Q646634) (← links)
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design (Q702717) (← links)
- GENI ants for the traveling salesman problem (Q702722) (← links)
- Design for optimized multi-lateral multi-commodity markets (Q706897) (← links)
- A stochastic program with time series and affine decision rules for the reservoir management problem (Q723959) (← links)
- An efficient heuristic for reliability design optimization problems (Q732879) (← links)
- Heuristics for the mixed swapping problem (Q733528) (← links)
- Flow-based integer linear programs to solve the weekly log-truck scheduling problem (Q748554) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- Heuristics for multi-period capacity expansion in local telecommunications networks (Q835760) (← links)
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routes (Q859687) (← links)
- Arc routing problems with time-dependent service costs (Q872235) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
- Optimizing profits from hydroelectricity production (Q954052) (← links)
- Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound (Q1010284) (← links)
- Novel reinforcement learning-based approaches to reduce loss probability in buffer-less OBS networks (Q1031021) (← links)
- An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles (Q1040998) (← links)
- Heuristics for the stochastic Eulerian tour problem (Q1043339) (← links)
- Optimizing daily agent scheduling in a multiskill call center (Q1044109) (← links)
- On the location of eigenvalues of off-diagonal constant matrices (Q1077491) (← links)
- An algorithm for network dimensioning under reliability considerations (Q1197791) (← links)
- Stochastic vehicle routing (Q1266554) (← 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)
