Pages that link to "Item:Q4126084"

The following pages link to A good algorithm for lexicographically optimal flows in multi-terminal networks (Q4126084):

Displayed 15 items.

• Allocation rules on networks (Q485430) ‎ (← links)
• Flow sharing and bankruptcy games (Q532705) ‎ (← links)
• The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (Q741538) ‎ (← links)
• A solution to the random assignment problem on the full preference domain (Q860356) ‎ (← links)
• Fair welfare maximization (Q1031840) ‎ (← links)
• Linear and combinatorial sharing problems (Q1081535) ‎ (← links)
• On the solution of discrete bottleneck problems (Q1167061) ‎ (← links)
• Algorithms and complexity analysis for some flow problems (Q1317482) ‎ (← links)
• Groupstrategyproofness of the egalitarian mechanism for constrained rationing problems (Q1680106) ‎ (← links)
• Decreasing minimization on M-convex sets: background and structures (Q2089794) ‎ (← links)
• Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) ‎ (← links)
• Fair-by-design matching (Q2212506) ‎ (← links)
• An approximation algorithm for the facility location problem with lexicographic minimax objective (Q2336537) ‎ (← links)
• Theory of Principal Partitions Revisited (Q2971607) ‎ (← links)
• Optimal sharing (Q3941156) ‎ (← links)