The following pages link to (Q4058442):
Displaying 50 items.
- Topology optimisation of repairable flow networks for a maximum average availability (Q356397) (← links)
- A competitive two-agent scheduling problem on parallel machines with release dates and preemption (Q460140) (← links)
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
- A new approach for solving the network problems (Q505104) (← links)
- A warm-start dual simplex solution algorithm for the minimum flow networks with postoptimality analyses (Q699349) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time (Q750277) (← links)
- On module assignment in two-processor distributed systems (Q754638) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- A simple version of Karzanov's blocking flow algorithm (Q795064) (← links)
- The maximum flow problem: A max-preflow approach (Q811325) (← links)
- Pattern matching with wildcards and length constraints using maximum network flow (Q891817) (← links)
- On size-constrained minimum \(s\mathrm{-}t\) cut problems and size-constrained dense subgraph problems (Q897915) (← links)
- The maximum flow problem of uncertain network (Q903658) (← links)
- Scaling algorithms for network problems (Q1079135) (← links)
- Unimodular functions (Q1079493) (← links)
- A decomposition algorithm for multi-terminal network flows (Q1085042) (← links)
- Multi-terminal maximum flows in node-capacitated networks (Q1085773) (← 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)
- Algebraic flows in regular matroids (Q1138993) (← links)
- An \(O(EV\log^2V)\) algorithm for the maximal flow problem (Q1147636) (← links)
- An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem (Q1151034) (← links)
- On the theoretical efficiency of various network flow algorithms (Q1154258) (← links)
- Optimal cocircuits in regular matroids and applications (Q1164550) (← links)
- On the solution of discrete bottleneck problems (Q1167061) (← links)
- Processor-efficient implementation of a maximum flow algorithm (Q1178222) (← links)
- Worst case behavior of the Dinic algorithm (Q1180321) (← links)
- A new Karzanov-type \(O(n^ 3)\) max-flow algorithm (Q1197076) (← links)
- An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree (Q1205700) (← links)
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks (Q1251587) (← links)
- Numerical investigations on the maximal flow algorithm of Karzanov (Q1255886) (← links)
- A parallel algorithm for finding a blocking flow in an acyclic network (Q1263969) (← links)
- Computational investigations of maximum flow algorithms (Q1278652) (← links)
- A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing (Q1327210) (← links)
- Local optima topology for the \(k\)-coloring problem (Q1327233) (← links)
- Maximal closure on a graph with resource constraints (Q1366709) (← links)
- On strongly polynomial dual simplex algorithms for the maximum flow problem (Q1373745) (← links)
- Strongly polynomial dual simplex methods for the maximum flow problem (Q1380934) (← links)
- An algorithmic study of the maximum flow problem: A comparative statistical analysis (Q1592633) (← links)
- A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks (Q1673339) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- An O(K.n**4) algorithm for finding the K best cuts in a network (Q1836587) (← links)
- A data structure for dynamic trees (Q1838310) (← links)
- Sequential and parallel algorithms for minimum flows. (Q1880468) (← links)
- A generalization of the scaling max-flow algorithm (Q1885993) (← links)
- Boolean regression (Q1904716) (← links)
