Pages that link to "Item:Q2088862"

The following pages link to Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm (Q2088862):

Displaying 11 items.

• The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2022333) (← links)
• Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance (Q2045028) (← links)
• Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector (Q2089873) (← links)
• Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2228401) (← links)
• Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479) (← links)
• The partial inverse minimum spanning tree problem when weight increase is forbidden (Q2470099) (← links)
• Algorithm for constraint partial inverse matroid problem with weight increase forbidden (Q2629239) (← links)
• Solving inverse spanning tree problems through network flow techniques (Q2770110) (← links)
• The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees (Q6102183) (← links)
• A penalty-type method for solving inverse optimal value problem in second-order conic programming (Q6546899) (← links)
• Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm (Q6582067) (← links)