Pages that link to "Item:Q2228401"
From MaRDI portal
The following pages link to Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2228401):
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)
- Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm (Q2088862) (← links)
- Partial inverse maximum spanning tree problem under the Chebyshev norm (Q2091101) (← links)
- Inverse optimization problems with multiple weight functions (Q2112661) (← links)
- The minmax regret inverse maximum weight problem (Q2243298) (← links)
- The restricted inverse optimal value problem on shortest path under \(l_1\) norm on trees (Q6102183) (← links)
- Best strategy to win a match: an analytical approach using hybrid machine learning-clustering-association rule framework (Q6115868) (← links)
- Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance (Q6181336) (← 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)