The following pages link to (Q4228440):
Displaying 21 items.
- A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
- Approximate binary search algorithms for mean cuts and cycles (Q1319679) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- A strongly polynomial algorithm for the minimum cost tension problem (Q1356759) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications (Q1774529) (← links)
- Parametric min-cuts analysis in a network. (Q1811086) (← links)
- An algorithm for fractional assignment problems (Q1842662) (← links)
- Parametric analysis of overall min-cuts and applications in undirected networks. (Q1853178) (← links)
- \(\varepsilon\)-approximation minimization of convex functions in fixed dimension (Q1919184) (← links)
- Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
- Discrete Newton methods for the evacuation problem (Q2330131) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- Flows over edge-disjoint mixed multipaths and applications (Q2381819) (← links)
- Reputation games for undirected graphs (Q2636798) (← links)
- Approximating a class of combinatorial problems with rational objective function (Q2638374) (← links)
- Complexity of source-sink monotone 2-parameter min cut (Q2670479) (← links)
- A fifth bibliography of fractional programming<sup>*</sup> (Q4265528) (← links)
- Maximizing residual flow under an arc destruction (Q4537607) (← links)
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q5101431) (← links)
- The multiroute maximum flow problem revisited (Q5469126) (← links)
