The following pages link to Fabien Tricoire (Q320695):
Displayed 23 items.
- A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience (Q320696) (← links)
- Multi-directional local search (Q339654) (← links)
- (Q406495) (redirect page) (← links)
- A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
- Addendum to ``Heuristics for the multi-period orienteering problem with multiple time windows'' (Q502476) (← links)
- Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
- Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
- Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
- New insights on the block relocation problem (Q1652454) (← links)
- The bi-objective stochastic covering tour problem (Q1762147) (← links)
- Exact and hybrid methods for the multiperiod field service routing problem (Q1788906) (← links)
- A local-search based heuristic for the unrestricted block relocation problem (Q2003414) (← links)
- A lexicographic minimax approach to the vehicle routing problem with route balancing (Q2282498) (← links)
- A heuristic algorithm for the free newspaper delivery problem (Q2355940) (← links)
- Vehicle and personnel routing optimization in the service sector: application to water distribution and treatment (Q2644384) (← links)
- Addendum to: ``FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming'' (Q2669770) (← links)
- Multiperiod Planning and Routing on a Rolling Horizon for Field Force Optimization Logistics (Q3564374) (← links)
- Branch-and-Bound for Bi-objective Integer Programming (Q5139633) (← links)
- A matheuristic for tri-objective binary integer linear programming (Q6065590) (← links)
- A lexicographic maximin approach to the selective assessment routing problem (Q6103191) (← links)
- A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem (Q6339309) (← links)
- A LP relaxation based matheuristic for multi-objective integer programming (Q6360009) (← links)
- An outer approximation algorithm for multi-objective mixed-integer linear and non-linear programming (Q6364158) (← links)