Pages that link to "Item:Q1725619"
From MaRDI portal
The following pages link to GRASP and VNS for solving the \(p\)-next center problem (Q1725619):
Displaying 6 items.
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
- GRASP with strategic oscillation for the \(\alpha \)-neighbor \(p\)-center problem (Q2673563) (← links)
- An iterated greedy algorithm for finding the minimum dominating set in graphs (Q6102924) (← links)
- Efficient iterated greedy for the two-dimensional bandwidth minimization problem (Q6106765) (← links)
- Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)
- Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem (Q6180026) (← links)
