Pages that link to "Item:Q1811146"
From MaRDI portal
The following pages link to Dominant, an algorithm for the \(p\)-center problem. (Q1811146):
Displaying 10 items.
- Bee colony optimization for the \(p\)-center problem (Q632685) (← links)
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
- A scalable exact algorithm for the vertex \(p\)-center problem (Q1634076) (← links)
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane (Q1752856) (← links)
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) (← links)
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
- Insertion heuristics for central cycle problems (Q3057168) (← links)
- Data Exploration by Representative Region Selection: Axioms and Convergence (Q4958552) (← 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)
