Pages that link to "Item:Q1210806"
From MaRDI portal
The following pages link to Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms (Q1210806):
Displaying 5 items.
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs (Q1315994) (← links)
- Algorithms for finding a \(K\)th best valued assignment (Q1327213) (← links)
- A new algorithm for general matching problems using network flow subproblems (Q3829354) (← links)
- (Q4540086) (← links)
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis (Q4764598) (← links)