The following pages link to Jacques Desrosiers (Q339691):
Displaying 50 items.
- A branch-price-and-cut algorithm for the workover rig routing problem (Q339692) (← links)
- Efficient symmetry breaking formulations for the job grouping problem (Q340336) (← links)
- The positive edge criterion within COIN-OR's CLP (Q342010) (← links)
- About the minimum mean cycle-canceling algorithm (Q499347) (← links)
- A two-level interior-point decomposition algorithm for multi-stage stochastic capacity planning and technology acquisition (Q548466) (← links)
- On compact formulations for integer programs solved by column generation (Q817199) (← links)
- A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites (Q856269) (← links)
- Classification of travelling salesman problem formulations (Q911990) (← links)
- Solving multi-stage stochastic in-house production and outsourcing planning by two-level decomposition (Q961461) (← links)
- On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
- Methods for routing with time windows (Q1068008) (← links)
- Vehicle routing with full loads (Q1099072) (← links)
- The pickup and delivery problem with time windows (Q1179004) (← links)
- (Q1278610) (redirect page) (← links)
- Crew pairing at Air France (Q1278613) (← links)
- Locomotive assignment with heterogeneous consists at CN North America (Q1278619) (← links)
- Stabilized column generation (Q1297485) (← links)
- A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
- Linear fractional approximations for master problems in column generation (Q1728318) (← links)
- Decomposition theorems for linear programs (Q1785306) (← links)
- Fleet assignment and routing with schedule synchronization constraints (Q1806762) (← links)
- A new branching strategy for time constrained routing problems with application to backhauling (Q1908295) (← links)
- The minimum mean cycle-canceling algorithm for linear programs (Q2076908) (← 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)
- Row-reduced column generation for degenerate master problems (Q2356253) (← links)
- Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems (Q2433389) (← links)
- Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues (Q2433546) (← links)
- Recovering an optimal LP basis from an optimal dual solution (Q2480056) (← links)
- A proximal trust-region algorithm for column generation stabilization (Q2571184) (← links)
- Solving a rich vehicle routing and inventory problem using column generation (Q2655647) (← links)
- Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems (Q2776562) (← links)
- The operational airline crew scheduling problem (Q2783811) (← links)
- The preferential bidding system at Air Canada (Q2783813) (← links)
- 2-path cuts for the vehicle routing problem with time windows (Q2783836) (← links)
- A Benders decomposition approach for the locomotive and car assignment problem (Q2783880) (← links)
- Path-reduced costs for eliminating arcs in routing and scheduling (Q2899063) (← links)
- Cutting planes for branch-and-price algorithms (Q3113514) (← links)
- A Branch-First, Cut-Second Approach for Locomotive Assignment (Q3116695) (← links)
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows (Q3141769) (← links)
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs (Q3202131) (← links)
- Plus court chemin avec contraintes d'horaires (Q3309472) (← links)
- Dual-Optimal Inequalities for Stabilized Column Generation (Q3391991) (← links)
- Simultaneous Assignment of Locomotives and Cars to Passenger Trains (Q3635020) (← links)
- (Q3688123) (← links)
- Routing with time windows by column generation (Q3688124) (← links)
- Vehicle routing and scheduling with time windows (Q3712128) (← links)
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows (Q3770308) (← links)
- Survey Paper—Time Window Constrained Routing and Scheduling Problems (Q3779986) (← links)
- Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows (Q3801320) (← links)
