Pages that link to "Item:Q1634076"
From MaRDI portal
The following pages link to A scalable exact algorithm for the vertex \(p\)-center problem (Q1634076):
Displaying 21 items.
- Enhancements to two exact algorithms for solving the vertex \(P\)-center problem (Q814956) (← links)
- The stratified \(p\)-center problem (Q2003436) (← links)
- An exact algorithm for a class of geometric set-cover problems (Q2030243) (← links)
- The conditional \(p\)-dispersion problem (Q2046325) (← links)
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
- The complete vertex \(p\)-center problem (Q2219518) (← links)
- An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034) (← links)
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering (Q2669483) (← links)
- The multi-period \(p\)-center problem with time-dependent travel times (Q2669591) (← links)
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
- An iterative exact algorithm for the weighted fair sequences problem (Q2676411) (← links)
- A new formulation and resolution method for the \(p\)-center problem (Q2890410) (← links)
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem (Q4216137) (← links)
- (Q4875162) (← links)
- A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
- Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418) (← links)
- Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem (Q6047873) (← links)
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem (Q6068702) (← links)
- Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem (Q6180026) (← links)
- A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems (Q6561237) (← links)
- A constructive heuristic for the uniform capacitated vertex \(k\)-center problem (Q6579775) (← links)
