Pages that link to "Item:Q1872013"

The following pages link to A note on the robust 1-center problem on trees (Q1872013):

Displaying 15 items.

• A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty (Q322691) (← links)
• Robust vertex \(p\)-center model for locating urgent relief distribution centers (Q336453) (← links)
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
• Minmax regret location--allocation problem on a network under uncertainty (Q864020) (← links)
• Robust placement of sensors in dynamic water distribution systems (Q1040992) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• An improved algorithm for the minmax regret path centdian problem on trees (Q1672003) (← links)
• Inverse quickest center location problem on a tree (Q1741512) (← links)
• Capacitated multi-period maximal covering location problem with server uncertainty (Q2029288) (← links)
• On the minmax regret path median problem on trees (Q2353396) (← links)
• Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management (Q2355922) (← links)
• New approaches to the robust 1-center location problems on tree networks (Q2678831) (← links)
• The \(p\)-center problem under locational uncertainty of demand points (Q2688470) (← links)
• The backup 2‐center and backup 2‐median problems on trees (Q5191127) (← links)
• Robust mean absolute deviation problems on networks with linear vertex weights (Q5326780) (← links)