Pages that link to "Item:Q4302935"

The following pages link to Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees (Q4302935):

Displaying 15 items.

• Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
• When centers can fail: a close second opportunity (Q337641) (← links)
• Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• Minimax models for capacitated \(p\)-center problem in uncertain environment (Q2052930) (← links)
• An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034) (← links)
• Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem (Q3386776) (← links)
• Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem (Q4474299) (← links)
• A polynomial algorithm for thep-centdian problem on a tree (Q4540080) (← links)
• The capacitated single-source p-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique (Q4987796) (← links)
• A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5896083) (← links)
• A strongly polynomial time algorithm for the maximum supply rate problem on trees (Q5919326) (← links)
• Capacitated location-allocation problems on a line (Q5959397) (← links)
• Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)