Pages that link to "Item:Q2765604"
From MaRDI portal
The following pages link to Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem (Q2765604):
Displaying 3 items.
- Algorithms for the partial inverse matroid problem in which weights can only be increased (Q312484) (← links)
- A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← links)
- Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm (Q1704922) (← links)
