Pages that link to "Item:Q4228787"

The following pages link to Minimax regret p-center location on a network with demand uncertainty (Q4228787):

Displaying 40 items.

• Backup multifacility location problem with \(l_p\) norm (Q260687) (← links)
• Minmax regret 1-facility location on uncertain path networks (Q297369) (← links)
• Robust facility location problem for hazardous waste transportation (Q301070) (← links)
• 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)
• An optimal algorithm for the weighted backup 2-center problem on a tree (Q513273) (← links)
• Computing the center of uncertain points on tree networks (Q527423) (← links)
• Flexible-attribute problems (Q616800) (← links)
• The minmax regret gradual covering location problem on a network with incomplete information of demand weights (Q621687) (← links)
• A note on the minmax regret centdian location on trees (Q935247) (← links)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
• Two-stage flexible-choice problems under uncertainty (Q1037661) (← links)
• Robustness in operational research and decision aiding: a multi-faceted issue (Q1044079) (← links)
• Algorithms for the robust 1-center problem on a tree (Q1569932) (← 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)
• A note on computing the center of uncertain data on the real line (Q1790197) (← links)
• Strategic facility location: A review (Q1806854) (← links)
• A two-stage robust model for a reliable \(p\)-center facility location problem (Q1988633) (← links)
• The stratified \(p\)-center problem (Q2003436) (← links)
• Capacitated multi-period maximal covering location problem with server uncertainty (Q2029288) (← links)
• Minmax regret for sink location on dynamic flow paths with general capacities (Q2133396) (← links)
• Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
• Robust min-max regret covering problems (Q2162527) (← 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)
• A distributionally robust optimization approach for two-stage facility location problems (Q2195563) (← links)
• Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities (Q2319636) (← 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 two-center problem of uncertain points on a real line (Q2687919) (← links)
• Minimax regret path location on trees (Q3100694) (← links)
• Relative Robust and Adaptive Optimization (Q3386774) (← 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)