Pages that link to "Item:Q3637389"

The following pages link to Efficient Algorithms for the Inverse Spanning-Tree Problem (Q3637389):

Displaying 27 items.

• Inverse eccentric vertex problem on networks (Q301951) (← links)
• Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
• Data-driven inverse optimization with imperfect information (Q681497) (← links)
• Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← 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)
• Inverse constrained bottleneck problems under weighted \(l_{\infty}\) norm (Q883285) (← links)
• Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← 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)
• Weak optimal inverse problems of interval linear programming based on KKT conditions (Q2057406) (← links)
• Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm (Q2088862) (← 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)
• 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)
• 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)
• Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
• Inverse min-max spanning r-arborescence problem under the weighted sum-type Hamming distance (Q2818313) (← links)
• Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy (Q2935310) (← links)
• Complexity of some inverse shortest path lengths problems (Q3057164) (← links)
• Inverse Optimization with Noisy Data (Q4971385) (← 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)