Pages that link to "Item:Q924129"
From MaRDI portal
The following pages link to Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (Q924129):
Displaying 28 items.
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
- Partial inverse min-max spanning tree problem (Q830941) (← links)
- Inverse minimum cost flow problems under the weighted Hamming distance (Q992575) (← links)
- Constrained inverse min-max spanning tree problems under the weighted Hamming distance (Q1029667) (← links)
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance (Q1670106) (← links)
- Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance (Q1707916) (← links)
- Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530) (← links)
- On inverse traveling salesman problems (Q1936660) (← links)
- Weighted inverse maximum perfect matching problems under the Hamming distance (Q1945512) (← links)
- Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059) (← 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)
- Constrained inverse minimum flow problems under the weighted Hamming distance (Q2049978) (← 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)
- Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance (Q2240118) (← 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 optimization problems under the Hamming distance (Q2575571) (← links)
- Inverse min-max spanning \(r\)-arborescence problem under the weighted sum-type Hamming distance (Q2818313) (← links)
- Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance (Q3225072) (← links)
- Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance (Q3611928) (← links)
- Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks (Q5013391) (← 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)
