The following pages link to Éric D. Taillard (Q227992):
Displaying 30 items.
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods (Q817180) (← links)
- (Q915634) (redirect page) (← links)
- Some efficient heuristic methods for the flow shop sequencing problem (Q915635) (← links)
- POPMUSIC for the point feature label placement problem (Q1011166) (← links)
- (Q1271379) (redirect page) (← links)
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem (Q1271380) (← links)
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem (Q1302554) (← links)
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective (Q1362944) (← links)
- Heuristic methods for large centroid clustering problems (Q1402504) (← links)
- Probabilistic diversification and intensification in local search for vehicle routing (Q1922635) (← links)
- Analysis and test of efficient methods for building recursive deterministic perceptron neural networks (Q1931966) (← links)
- POPMUSIC for the travelling salesman problem (Q1991147) (← links)
- A linearithmic heuristic for the travelling salesman problem (Q2242243) (← links)
- Benchmarks for basic scheduling problems (Q2366085) (← links)
- A user's guide to tabu search (Q2366991) (← links)
- Solving real-life vehicle routing problems efficiently using tabu search (Q2367019) (← links)
- Few statistical tests for proportions comparison (Q2464220) (← links)
- (Q2776577) (← links)
- Ant colonies for the quadratic assignment problem (Q3157308) (← links)
- POPMUSIC for a real-world large-scale vehicle routing problem with time windows (Q3394079) (← links)
- Comparison of iterative searches for the quadratic assignment problem (Q4229645) (← links)
- Parallel iterative search methods for vehicle routing problems (Q4291474) (← links)
- Parallel Taboo Search Techniques for the Job Shop Scheduling Problem (Q4302712) (← links)
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows (Q4355334) (← links)
- (Q4365130) (← links)
- A heuristic column generation method for the heterogeneous fleet VRP (Q4511603) (← links)
- Vehicle Routeing with Multiple Use of Vehicles (Q4717157) (← links)
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching (Q4950868) (← links)
- Metaheuristics for Hard Optimization (Q5200616) (← links)
- Adaptive memory programming: a unified view of metaheuristics (Q5954822) (← links)
