Pages that link to "Item:Q2890410"

The following pages link to A new formulation and resolution method for the \(p\)-center problem (Q2890410):

Displaying 8 items.

• Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem (Q6047873) (← links)
• Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)
• A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem (Q6068702) (← links)
• Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)
• Territorial design for customers with demand frequency (Q6112738) (← links)
• Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← 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)