Pages that link to "Item:Q3503010"
From MaRDI portal
The following pages link to A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE (Q3503010):
Displaying 8 items.
- 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)
- Weighted inverse maximum perfect matching problems under the Hamming distance (Q1945512) (← links)
- Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance (Q2240118) (← links)
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
- (Q3466910) (← links)
- A weighted inverse minimum \(s-t\) cut problem with value constraint under the Bottleneck-type Hamming distance (Q6561572) (← links)
