Pages that link to "Item:Q1044136"

The following pages link to Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136):

Displaying 13 items.

• Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
• Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
• When centers can fail: a close second opportunity (Q337641) (← links)
• An optimal algorithm for the weighted backup 2-center problem on a tree (Q513273) (← 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 stratified \(p\)-center problem (Q2003436) (← links)
• A dual bounding scheme for a territory design problem (Q2257364) (← links)
• Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management (Q2355922) (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• Location of Emergency Facilities with Uncertainty in the Demands (Q4555566) (← links)
• The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique (Q4987796) (← links)
• Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)