Pages that link to "Item:Q2470099"

The following pages link to The partial inverse minimum spanning tree problem when weight increase is forbidden (Q2470099):

Displaying 17 items.

• Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
• The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
• Partial inverse min-max spanning tree problem (Q830941) (← links)
• A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← links)
• Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922) (← links)
• 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)
• Partial inverse maximum spanning tree problem under the Chebyshev norm (Q2091101) (← links)
• Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm (Q2150566) (← links)
• Approximation algorithms for capacitated partial inverse maximum spanning tree problem (Q2176281) (← links)
• Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2228401) (← links)
• The minmax regret inverse maximum weight problem (Q2243298) (← links)
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
• Algorithm for constraint partial inverse matroid problem with weight increase forbidden (Q2629239) (← links)
• Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance (Q6181336) (← links)
• Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm (Q6582067) (← links)