A good algorithm for lexicographically optimal flows in multi-terminal networks
From MaRDI portal
Publication:4126084
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- Network Flow and Testing Graph Connectivity
- Optimal flows in networks with multiple sources and sinks
- Paths, Trees, and Flowers
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(15)- Fair-by-design matching
- Allocation rules on networks
- Flow sharing and bankruptcy games
- A solution to the random assignment problem on the full preference domain
- Linear and combinatorial sharing problems
- The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths
- Algorithms and complexity analysis for some flow problems
- Theory of principal partitions revisited
- Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems
- An approximation algorithm for the facility location problem with lexicographic minimax objective
- Optimal sharing
- Fair welfare maximization
- Decreasing minimization on M-convex sets: background and structures
- On the solution of discrete bottleneck problems
- Decreasing minimization on M-convex sets: algorithms and applications
This page was built for publication: A good algorithm for lexicographically optimal flows in multi-terminal networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4126084)
