The following pages link to Guy Desaulniers (Q319362):
Displaying 50 items.
- The shortest path problem with forbidden paths (Q146692) (← links)
- The discrete time window assignment vehicle routing problem (Q319363) (← links)
- A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times (Q320872) (← links)
- Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks (Q322560) (← links)
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
- Recoverable robust single day aircraft maintenance routing problem (Q337121) (← links)
- A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← links)
- A branch-price-and-cut algorithm for the workover rig routing problem (Q339692) (← links)
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads (Q339703) (← links)
- (Q398873) (redirect page) (← links)
- A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts (Q398875) (← links)
- Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods (Q421554) (← links)
- Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem (Q743645) (← links)
- A comparison of five heuristics for the multiple depot vehicle scheduling problem (Q835636) (← links)
- Lower bounds and a tabu search algorithm for the minimum deficiency problem (Q841600) (← links)
- Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation (Q856697) (← links)
- Parking buses in a depot using block patterns: a Benders decomposition approach for minimizing type mismatches (Q883301) (← links)
- Multi-phase dynamic constraint aggregation for set partitioning type problems (Q964175) (← links)
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows (Q976316) (← links)
- (Q1278609) (redirect page) (← links)
- Crew pairing at Air France (Q1278613) (← links)
- The pickup and delivery problem with time windows and handling operations (Q1652028) (← links)
- A new heuristic branching scheme for the crew pairing problem with base constraints (Q1652206) (← links)
- The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints (Q1681502) (← links)
- Linear fractional approximations for master problems in column generation (Q1728318) (← links)
- Two decomposition algorithms for solving a minimum weight maximum clique model for the air conflict resolution problem (Q1752252) (← links)
- Multi-depot vehicle scheduling problems with time windows and waiting costs (Q1806860) (← links)
- Column generation for vehicle routing problems with multiple synchronization constraints (Q1991183) (← links)
- Accelerating Benders decomposition for short-term hydropower maintenance scheduling (Q2028814) (← links)
- Real-time bi-objective personnel re-scheduling in the retail industry (Q2030505) (← links)
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
- A decomposition-based heuristic for large employee scheduling problems with inter-department transfers (Q2175366) (← links)
- Dynamic constraint aggregation for solving very large-scale airline crew pairing problems (Q2226471) (← links)
- The inventory routing problem with demand moves (Q2226502) (← links)
- Stabilized dynamic constraint aggregation for solving set partitioning problems (Q2253353) (← links)
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem (Q2281613) (← links)
- A branch-and-price heuristic for the crew pairing problem with language constraints (Q2294642) (← links)
- A two-stage solution approach for personalized multi-department multi-day shift scheduling (Q2327641) (← links)
- Creating annual delivery programs of liquefied natural gas (Q2358149) (← links)
- Parking buses in a depot with stochastic arrival times (Q2371342) (← links)
- Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues (Q2433546) (← links)
- Bi-dynamic constraint aggregation and subproblem reduction (Q2459403) (← links)
- Real-time personnel re-scheduling after a minor disruption in the retail industry (Q2664293) (← links)
- The joint network vehicle routing game with optional customers (Q2668799) (← links)
- Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering (Q2669662) (← links)
- An improved formulation for the inventory routing problem with time-varying demands (Q2672144) (← links)
- Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems (Q2776562) (← links)
- The shortest path problem with time windows and linear waiting costs (Q2783892) (← links)
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem (Q2811322) (← links)
- Path-reduced costs for eliminating arcs in routing and scheduling (Q2899063) (← links)
