The following pages link to (Q4363164):
Displaying 16 items.
- Some inverse optimization problems on network (Q394471) (← links)
- Reconstruction of graphs based on random walks (Q837176) (← links)
- A constructive algorithm for realizing a distance matrix (Q858334) (← links)
- Inverse minimum flow problem (Q874337) (← links)
- Reverse 2-median problem on trees (Q943832) (← links)
- A further study on inverse linear programming problems (Q1298792) (← links)
- Inverse optimization in high-speed networks (Q1399112) (← links)
- Inapproximability and a polynomially solvable special case of a network improvement problem. (Q1428068) (← links)
- The inverse optimal value problem (Q1769073) (← links)
- On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching (Q1806920) (← links)
- Inverse optimization problems with multiple weight functions (Q2112661) (← links)
- Distance spectra of graphs: a survey (Q2250935) (← links)
- Imputing a variational inequality function or a convex objective function: a robust approach (Q2408655) (← links)
- On the structure of the inverse-feasible region of a linear program (Q2417071) (← links)
- A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm (Q2494305) (← links)
- (Q5009558) (← links)