Pages that link to "Item:Q2770110"
From MaRDI portal
The following pages link to Solving Inverse Spanning Tree Problems Through Network Flow Techniques (Q2770110):
Displayed 8 items.
- Inverse minimum flow problem (Q874337) (← links)
- Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530) (← links)
- Inverse conic programming with applications (Q1779714) (← links)
- The base-matroid and inverse combinatorial optimization problems. (Q1811117) (← links)
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes (Q2385479) (← links)
- The partial inverse minimum spanning tree problem when weight increase is forbidden (Q2470099) (← links)
- Some inverse optimization problems under the Hamming distance (Q2575571) (← links)
- The inverse maximum flow problem considering<i>l</i><sub>∞</sub>norm (Q3598045) (← links)