Pages that link to "Item:Q1774530"
From MaRDI portal
The following pages link to Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530):
Displayed 13 items.
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems (Q885822) (← links)
- Inverse min-max spanning tree problem under the weighted sum-type Hamming distance (Q924129) (← 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)
- Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance (Q1034103) (← links)
- The center location improvement problem under the Hamming distance (Q1781802) (← links)
- The shortest path improvement problems under Hamming distance (Q2385466) (← links)
- Inverse maximum flow problems under the weighted Hamming distance (Q2385473) (← links)
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479) (← links)
- Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance (Q2494303) (← links)
- Some inverse optimization problems under the Hamming distance (Q2575571) (← links)
- Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance (Q3225072) (← links)
- A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE (Q3503010) (← links)