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 13 items.

• A scalable exact algorithm for the vertex \(p\)-center problem (Q1634076) (← links)
• Compact MILP formulations for the \(p\)-center problem (Q1661850) (← links)
• The stratified \(p\)-center problem (Q2003436) (← links)
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem (Q2253409) (← links)
• A new formulation and resolution method for the \(p\)-center problem (Q2890410) (← links)
• 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)
• New formulations for two location problems with interconnected facilities (Q6128897) (← 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)
• A scaleable projection-based branch-and-cut algorithm for the $p$-center problem (Q6375349) (← links)
• Three network design problems for community energy storage (Q6659084) (← links)