Pages that link to "Item:Q1811071"

The following pages link to Complexity of robust single facility location problems on networks with uncertain edge lengths. (Q1811071):

Displaying 20 items.

• Robust vertex \(p\)-center model for locating urgent relief distribution centers (Q336453) (← links)
• On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
• Complexity of the min-max and min-max regret assignment problems (Q813974) (← links)
• Minimax regret spanning arborescences under uncertain costs (Q881514) (← links)
• A 2-approximation for minmax regret problems via a mid-point scenario optimal solution (Q991475) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← 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)
• Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← 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)
• 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)
• Lexicographic<i>α</i>-robustness: an application to the 1-median problem (Q3561752) (← links)
• Ambulance Emergency Response Optimization in Developing Countries (Q5144767) (← links)
• Robust mean absolute deviation problems on networks with linear vertex weights (Q5326780) (← links)
• Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)