Pages that link to "Item:Q3754450"
From MaRDI portal
The following pages link to Fast Algorithms for Bipartite Network Flow (Q3754450):
Displaying 14 items.
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
- The subset assignment problem for data placement in caches (Q724230) (← links)
- Baseball playoff eliminations: An application of linear programming. Erratum (Q807312) (← links)
- Using combinatorial optimization in model-based trimmed clustering with cardinality constraints (Q962299) (← links)
- On the efficiency of maximum-flow algorithms on networks with small integer capacities (Q1111460) (← links)
- Scheduling unit-time jobs on processors with different capabilities (Q1121780) (← links)
- A parametric maximum flow algorithm for bipartite graphs with applications (Q1129980) (← links)
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem (Q1180817) (← links)
- Reshipments and overshipments in transportation problems with minimax objective (Q1182137) (← links)
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (Q1306364) (← links)
- Scheduling jobs to minimize total cost (Q1330553) (← links)
- A new?old algorithm for minimum-cut and maximum-flow in closure graphs (Q2744651) (← links)
- Polymatroidal flow network models with multiple sinks (Q3796942) (← links)
- Parallel output-sensitive algorithms for combinatorial and linear algebra problems (Q5943098) (← links)
