Pages that link to "Item:Q814956"

The following pages link to Enhancements to two exact algorithms for solving the vertex \(P\)-center problem (Q814956):

Displaying 13 items.

• Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
• New algorithms for \(k\)-center and extensions (Q849133) (← links)
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem (Q1628040) (← links)
• A scalable exact algorithm for the vertex \(p\)-center problem (Q1634076) (← 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)
• The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory (Q2629705) (← links)
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
• Integrating heuristic information into exact methods: The case of the vertex p-centre problem (Q4933644) (← 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 constructive heuristic for the uniform capacitated vertex \(k\)-center problem (Q6579775) (← links)