Pages that link to "Item:Q1806920"
From MaRDI portal
The following pages link to On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching (Q1806920):
Displaying 10 items.
- Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
- A compact linear program for testing optimality of perfect matchings. (Q1412705) (← links)
- On inverse problems of optimum perfect matching (Q1417847) (← links)
- On inverse linear programming problems under the bottleneck-type weighted Hamming distance (Q1707916) (← links)
- Inverse multiobjective optimization: inferring decision criteria from data (Q2038913) (← links)
- Inverse optimization problems with multiple weight functions (Q2112661) (← links)
- Algorithm for constraint partial inverse matroid problem with weight increase forbidden (Q2629239) (← links)
- An interior-point algorithm for solving inverse linear optimization problem (Q2903128) (← links)
- On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance (Q4626658) (← links)
- A replica analysis of the minimum weight solution to the linear equations problem (Q4785297) (← links)
