Pages that link to "Item:Q1569932"

The following pages link to Algorithms for the robust 1-center problem on a tree (Q1569932):

Displaying 31 items.

• Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
• Robust facility location problem for hazardous waste transportation (Q301070) (← 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)
• An optimal algorithm for the weighted backup 2-center problem on a tree (Q513273) (← links)
• Flexible-attribute problems (Q616800) (← links)
• The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687) (← links)
• Minimax regret 1-median problem in dynamic path networks (Q726099) (← links)
• Minmax regret location--allocation problem on a network under uncertainty (Q864020) (← links)
• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks (Q896121) (← links)
• A note on the minmax regret centdian location on trees (Q935247) (← links)
• Two-stage flexible-choice problems under uncertainty (Q1037661) (← 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)
• Facility location problems with uncertainty on the plane (Q1779686) (← links)
• Complexity of robust single facility location problems on networks with uncertain edge lengths. (Q1811071) (← links)
• 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem (Q2102848) (← links)
• Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
• Constant work-space algorithms for facility location problems (Q2192101) (← links)
• An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
• A robust \(p\)-center problem under pressure to locate shelters in wildfire context (Q2195562) (← links)
• Robust absolute single machine makespan scheduling-location problem on trees (Q2294524) (← links)
• Minimax regret 1-sink location problem in dynamic path networks (Q2348257) (← 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)
• Minimax regret path location on trees (Q3100694) (← 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)
• Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem (Q6047873) (← links)
• Robust maximum capture facility location under random utility maximization models (Q6113461) (← links)