Pages that link to "Item:Q2027024"
From MaRDI portal
The following pages link to Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem (Q2027024):
Displaying 9 items.
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
- A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem (Q2070130) (← links)
- Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints (Q2108178) (← links)
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering (Q2669483) (← links)
- A parallel variable neighborhood search approach for the obnoxious <i>p</i>‐median problem (Q6088247) (← links)
- A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment (Q6090150) (← links)
- A multi-objective linear programming model for scheduling part families and designing a group layout in cellular manufacturing systems (Q6109299) (← links)
- A matheuristic for locating obnoxious facilities (Q6568397) (← links)
- An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem (Q6609705) (← links)
