Pages that link to "Item:Q3793913"

The following pages link to Relaxation method for the solution of the minimax location-allocation problem in Euclidean space (Q3793913):

Displaying 13 items.

• An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem (Q342496) (← links)
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems (Q959511) (← links)
• A relaxation-based algorithm for solving the conditional \(p\)-center problem (Q974996) (← links)
• Algorithms for the m-center problems: A survey (Q1162436) (← links)
• A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem (Q1291662) (← links)
• A projection method for \(l_ p\) norm location-allocation problems (Q1337136) (← links)
• Location and layout planning. A survey (Q1372765) (← 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)
• Spherical minimax location problem using the Euclidean norm: Formulation and optimization (Q1804377) (← links)
• The conditional \(p\)-dispersion problem (Q2046325) (← links)
• The continuousm-center problem on a network (Q3703609) (← links)
• Relajacion lagrangeana para el problema de particionamiento de áreas geográficas (Q5248771) (← links)