The following pages link to Guy Desaulniers (Q319362):
Displaying 32 items.
- An improved primal simplex algorithm for degenerate linear programs (Q2899148) (← links)
- Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows (Q2957464) (← links)
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows (Q3057119) (← links)
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows (Q3100458) (← links)
- Cutting planes for branch-and-price algorithms (Q3113514) (← links)
- (Q4294142) (← links)
- Daily Aircraft Routing and Scheduling (Q4356631) (← links)
- Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit Systems (Q4411191) (← links)
- (Q4532229) (← links)
- (Q4532231) (← links)
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
- (Q4699369) (← links)
- (Q4955266) (← links)
- (Q4955271) (← links)
- Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times (Q4994167) (← links)
- Addressing Orientation Symmetry in the Time Window Assignment Vehicle Routing Problem (Q4995084) (← links)
- Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows (Q5086013) (← links)
- Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity (Q5086014) (← links)
- Integral Column Generation for Set Partitioning Problems with Side Constraints (Q5106424) (← links)
- Dynamic Aggregation of Set-Partitioning Constraints in Column Generation (Q5322124) (← links)
- A New Variant of the Minimum-Weight Maximum-Cardinality Clique Problem to Solve Conflicts between Aircraft (Q5356963) (← links)
- Shortest Path Problems with Resource Constraints (Q5493627) (← links)
- Selective arc‐ng pricing for vehicle routing (Q6092607) (← links)
- Routing electric vehicles with a single recharge per route (Q6092658) (← links)
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows (Q6160235) (← links)
- Assigning Team Tasks and Multiple Activities to Fixed Work Shifts (Q6160387) (← links)
- Valid Inequalities and Separation Algorithms for the Set Partitioning Problem (Q6160432) (← links)
- Learning to repeatedly solve routing problems (Q6196890) (← links)
- A stochastic integer programming approach to reserve staff scheduling with preferences (Q6413469) (← links)
- A parallel ruin and recreate heuristic for personnel scheduling in a flexible working environment (Q6547137) (← links)
- An improved column-generation-based matheuristic for learning classification trees (Q6561222) (← links)
- A stochastic integer programming approach to reserve staff scheduling with preferences (Q6609716) (← links)
