The following pages link to Jonathan F. Bard (Q322757):
Displaying 14 items.
- Benders decomposition and an IP-based heuristic for selecting IMRT treatment beam angles (Q322758) (← links)
- Large-scale pickup and delivery work area design (Q339655) (← links)
- Flexible weekly tour scheduling for postal service workers using a branch and price (Q398850) (← links)
- A sequential GRASP for the therapist routing and scheduling problem (Q398907) (← links)
- A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
- A two-stage stochastic programming approach for project planning with uncertain activity durations (Q835555) (← links)
- The task assignment problem for unrestricted movement between workstation groups (Q880551) (← links)
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic (Q880573) (← links)
- Validating vehicle routing zone construction using Monte Carlo simulation (Q976400) (← links)
- A branch-and-price algorithm for an integrated production and inventory routing problem (Q991383) (← links)
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation (Q1728503) (← links)
- A stochastic optimization approach to shift scheduling with breaks adjustments (Q1738827) (← links)
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment (Q1761180) (← links)
- Solving the waste bin location problem with uncertain waste generation rate: a bi-objective robust optimization approach (Q6528217) (← links)
