Pages that link to "Item:Q959511"

The following pages link to New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511):

Displaying 12 items.

• Robust vertex \(p\)-center model for locating urgent relief distribution centers (Q336453) (← links)
• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
• The maximin gradual cover location problem (Q480773) (← links)
• Bee colony optimization for the \(p\)-center problem (Q632685) (← links)
• A relaxation-based algorithm for solving the conditional \(p\)-center problem (Q974996) (← links)
• The mixed center location problem (Q1631666) (← 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)
• The conditional \(p\)-dispersion problem (Q2046325) (← links)
• Data Exploration by Representative Region Selection: Axioms and Convergence (Q4958552) (← links)
• Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418) (← links)
• Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem (Q6180026) (← links)