Pages that link to "Item:Q1944389"

The following pages link to Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems (Q1944389):

Displayed 9 items.

• Bound and exact methods for assessing link vulnerability in complex networks (Q405658) ‎ (← links)
• Blockers for the stability number and the chromatic number (Q489343) ‎ (← links)
• Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) ‎ (← links)
• On the hardness of covering-interdiction problems (Q2031041) ‎ (← links)
• Interdicting facilities in tree networks (Q2121611) ‎ (← links)
• Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) ‎ (← links)
• Critical edges for the assignment problem: complexity and exact resolution (Q2450758) ‎ (← links)
• An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) ‎ (← links)
• Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) ‎ (← links)