Pages that link to "Item:Q2496034"

The following pages link to An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034):

Displaying 13 items.

• Tabu search for the real-world carpooling problem (Q306096) (← links)
• 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)
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
• A scalable exact algorithm for the vertex \(p\)-center problem (Q1634076) (← links)
• A comprehensive modeling framework for hazmat network design, hazmat response team location, and equity of risk (Q1652154) (← links)
• Efficient sensor network management for asset localization (Q1654358) (← links)
• \(k\)-balanced center location problem: a new multi-objective facility location problem (Q1722964) (← links)
• The stratified \(p\)-center problem (Q2003436) (← links)
• A dual bounding scheme for a territory design problem (Q2257364) (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)