The following pages link to (Q4716335):
Displaying 17 items.
- Notes on inverse bin-packing problems (Q458387) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← links)
- Partial inverse min-max spanning tree problem (Q830941) (← links)
- Inverse minimum flow problem (Q874337) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- Note on inverse problem with \(l_\infty\) objective function (Q1272735) (← links)
- Inverse problem of minimum cuts (Q1298756) (← links)
- Inverse maximum capacity problems (Q1387947) (← links)
- Inverse problems of submodular functions on digraphs (Q1573989) (← links)
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
- Weighted inverse minimum spanning tree problems under Hamming distance (Q1774530) (← links)
- Two general methods for inverse optimization problems (Q1808980) (← links)
- Calculating some inverse linear programming problems (Q1923457) (← links)
- The lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2022333) (← links)
- Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance (Q2045028) (← links)
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm (Q2205945) (← links)
- Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm (Q2228401) (← links)
