Pages that link to "Item:Q2467473"

The following pages link to The \(p\)-maxian problem on a tree (Q2467473):

Displaying 17 items.

• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
• The backup 2-median problem on block graphs (Q403496) (← links)
• Median problems with positive and negative weights on cycles and cacti (Q604872) (← links)
• The \(p\)-Maxian problem on interval graphs (Q608284) (← links)
• The \(p\)-maxian problem on block graphs (Q711397) (← links)
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
• A polynomial method for the pos/neg weighted 3-median problem on a tree (Q1006548) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835) (← links)
• Inverse quickest center location problem on a tree (Q1741512) (← links)
• Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks (Q2158608) (← links)
• A combinatorial algorithm for the ordered 1-median problem on cactus graphs (Q2329555) (← links)
• The 2-maxian problem on cactus graphs (Q2339821) (← links)
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (Q2632017) (← links)
• The balanced 2-median and 2-maxian problems on a tree (Q2687920) (← links)
• A modified optimal algorithm for 2-maxian location problems on cactus graphs (Q2979777) (← links)
• Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks (Q6080433) (← links)