Pages that link to "Item:Q2385473"
From MaRDI portal
The following pages link to Inverse maximum flow problems under the weighted Hamming distance (Q2385473):
Displayed 9 items.
- The inverse maximum dynamic flow problem (Q625882) (← links)
- Inverse scheduling: Two-machine flow-shop problem (Q640308) (← 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)
- Inverse scheduling with maximum lateness objective (Q1041341) (← links)
- A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE (Q3503010) (← links)
- The inverse maximum flow problem considering<i>l</i><sub>∞</sub>norm (Q3598045) (← links)