Pages that link to "Item:Q5689828"
From MaRDI portal
The following pages link to A network flow method for solving some inverse combinatorial optimization problems (Q5689828):
Displayed 16 items.
- Note on inverse problem with \(l_\infty\) objective function (Q1272735) (← links)
- Inverse problem of minimum cuts (Q1298756) (← links)
- A further study on inverse linear programming problems (Q1298792) (← links)
- Inverse maximum capacity problems (Q1387947) (← links)
- Inverse problems of submodular functions on digraphs (Q1573989) (← links)
- Some reverse location problems (Q1576337) (← links)
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance (Q2045028) (← links)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
- Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2228401) (← 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)
- Partial inverse assignment problems under \(l_{1}\) norm (Q2643813) (← links)
- Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem (Q2765604) (← links)
- Inverse maximum flow and minimum cut problems (Q4338054) (← links)
- Efficient algorithms for the reverse shortest path problem on trees under the hamming distance (Q4987673) (← links)
- A class of bottleneck expansion problems (Q5936134) (← links)