Pages that link to "Item:Q1661850"

The following pages link to Compact MILP formulations for the \(p\)-center problem (Q1661850):

Displaying 9 items.

• Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
• A tighter formulation of the \(p\)-median problem (Q2268764) (← links)
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
• A new formulation and resolution method for the \(p\)-center problem (Q2890410) (← links)
• MILP-Formulations for the Total Adjustment Cost Problem (Q5171822) (← links)
• Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem (Q6047873) (← links)
• New formulations for two location problems with interconnected facilities (Q6128897) (← links)
• Exact solution approaches for the discrete <i>α</i>‐neighbor <i>p</i>‐center problem (Q6180026) (← links)
• Compact MILP formulations for the $p$-center problem (Q6425930) (← links)