Pages that link to "Item:Q2673558"

The following pages link to A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558):

Displaying 5 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)
• An efficient Benders decomposition for the \(p\)-median problem (Q6167396) (← links)
• Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem (Q6180026) (← links)