Pages that link to "Item:Q1908996"
From MaRDI portal
The following pages link to Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements (Q1908996):
Displaying 10 items.
- A cooperative hyper-heuristic search framework (Q604941) (← links)
- A parallel branch-and-bound algorithm for multicommodity location with balancing requirements (Q1370711) (← links)
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue (Q1908990) (← links)
- Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements (Q1919844) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Parallel local search (Q1922627) (← links)
- A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements (Q2146977) (← links)
- An approach for solving competitive location problems with variable demand using multicore systems (Q2448138) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
