Pages that link to "Item:Q336682"

The following pages link to Double bound method for solving the \(p\)-center location problem (Q336682):

Displayed 16 items.

• Capacitated \(p\)-center problem with failure foresight (Q319964) ‎ (← links)
• Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem (Q1628040) ‎ (← links)
• A scalable exact algorithm for the vertex \(p\)-center problem (Q1634076) ‎ (← links)
• The probabilistic \(p\)-center problem: planning service for potential customers (Q1683071) ‎ (← links)
• GRASP and VNS for solving the \(p\)-next center problem (Q1725619) ‎ (← links)
• The stratified \(p\)-center problem (Q2003436) ‎ (← links)
• Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants (Q2108113) ‎ (← links)
• A robust \(p\)-center problem under pressure to locate shelters in wildfire context (Q2195562) ‎ (← links)
• The complete vertex \(p\)-center problem (Q2219518) ‎ (← links)
• A comparative study of different formulations for the capacitated discrete ordered median problem (Q2664433) ‎ (← links)
• The multi-period \(p\)-center problem with time-dependent travel times (Q2669591) ‎ (← links)
• A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) ‎ (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) ‎ (← 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)