The following pages link to (Q3352816):
Displaying 28 items.
- On the Pythagorean Structure of the Optimal Transport for Separable Cost Functions (Q93069) (← links)
- Fair matchings and related problems (Q270032) (← links)
- Polynomial dual network simplex algorithms (Q689130) (← links)
- Processor-efficient implementation of a maximum flow algorithm (Q1178222) (← links)
- On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
- Upper bounds for the diameter and height of graphs of convex polyhedra (Q1196197) (← links)
- A natural randomization strategy for multicommodity flow and related algorithms (Q1198070) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- On the maximum capacity augmentation algorithm for the maximum flow problem (Q1314319) (← links)
- Tight bounds on the number of minimum-mean cycle cancellations and related results (Q1317475) (← links)
- Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs (Q1317479) (← links)
- A faster parametric minimum-cut algorithm (Q1317480) (← links)
- Algorithms and complexity analysis for some flow problems (Q1317482) (← links)
- Parallel algorithms for the assignment and minimum-cost flow problems (Q1319670) (← links)
- Balancing problems in acyclic networks (Q1327220) (← links)
- Approximate decision algorithms for point set congruence (Q1328753) (← links)
- Minimum cost multiflows in undirected networks (Q1337137) (← links)
- A network flow algorithm for just-in-time project scheduling (Q1342048) (← links)
- Dynamic expression trees (Q1346771) (← links)
- Multiflows and disjoint paths of minimum total cost (Q1373749) (← links)
- Inverse problems of submodular functions on digraphs (Q1573989) (← links)
- Convexification of generalized network flow problem (Q1717233) (← links)
- Complexity of strict robust integer minimum cost flow problems: an overview and further results (Q1725614) (← links)
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (Q2082183) (← links)
- Local distance constrained bribery in voting (Q2215965) (← links)
- Network design and flow problems with cross-arc costs (Q2482771) (← links)
- (Q5111621) (← links)
- (Q5136330) (← links)
