Pages that link to "Item:Q3424832"
From MaRDI portal
The following pages link to Parallel Variable Neighborhood Search (Q3424832):
Displaying 17 items.
- A binary multiple knapsack model for single machine scheduling with machine unavailability (Q342369) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks (Q1652107) (← links)
- A hybrid CPU-GPU parallelization scheme of variable neighborhood search for inventory optimization problems (Q1687632) (← links)
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem (Q1694919) (← links)
- Across neighborhood search for numerical optimization (Q1750545) (← links)
- The parallel variable neighborhood search for the \(p\)-median problem (Q1850991) (← links)
- Parallel local search (Q1922627) (← links)
- A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times (Q1935881) (← links)
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213) (← links)
- A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← links)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- MPI parallelization of variable neighborhood search (Q2840781) (← links)
- Parallel Solution Methods for Vehicle Routing Problems (Q3564355) (← links)
- Variable Neighborhood Programming as a Tool of Machine Learning (Q5153506) (← links)
- Parallel variable neighbourhood search algorithms for job shop scheduling problems (Q5432691) (← links)
- General variable neighborhood search approach to group Steiner tree problem (Q6063507) (← links)
