Pages that link to "Item:Q4050411"

The following pages link to Optimal flows in networks with multiple sources and sinks (Q4050411):

Displaying 50 items.

• Allocation rules on networks (Q485430) (← links)
• Flow sharing and bankruptcy games (Q532705) (← links)
• Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
• The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (Q741538) (← links)
• Structural theorems for submodular functions, polymatroids and polymatroid intersections (Q757383) (← links)
• Dynamic pricing and the direct-to-customer model in the automotive industry (Q816732) (← links)
• A solution to the random assignment problem on the full preference domain (Q860356) (← links)
• Eisenberg-Gale markets: algorithms and game-theoretic properties (Q993788) (← links)
• Submodular function minimization (Q995782) (← links)
• Optimal building evacuation time considering evacuation routes (Q1011205) (← links)
• Linear and combinatorial sharing problems (Q1081535) (← links)
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
• Efficient continuous-time dynamic network flow algorithms (Q1306377) (← links)
• A push-relabel framework for submodular function minimization and applications to parametric optimization (Q1410685) (← links)
• Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability (Q1410694) (← links)
• A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks (Q1673339) (← links)
• A note on balanced flows in equality networks (Q1730034) (← links)
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
• Free intermediation in resource transmission (Q1792561) (← links)
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested (Q1926640) (← links)
• Equivalence of convex minimization problems over base polytopes (Q1926652) (← links)
• Eliminating transplant waiting time inequities -- with an application to kidney allocation in the USA (Q2060410) (← links)
• Decreasing minimization on M-convex sets: background and structures (Q2089794) (← links)
• Decreasing minimization on M-convex sets: algorithms and applications (Q2089795) (← links)
• Decreasing minimization on base-polyhedra: relation between discrete and continuous cases (Q2111551) (← links)
• An approximation to max min fairness in multi commodity networks (Q2183560) (← links)
• Extended random assignment mechanisms on a family of good sets (Q2241324) (← links)
• Partial contraflow with path reversals for evacuation planning (Q2288951) (← links)
• Submodular optimization views on the random assignment problem (Q2330658) (← links)
• An approximation algorithm for the facility location problem with lexicographic minimax objective (Q2336537) (← links)
• Fair optimization and networks: a survey (Q2336590) (← links)
• Max-min fair rate allocation and routing in energy harvesting networks: algorithmic analysis (Q2362358) (← links)
• A strongly polynomial algorithm for line search in submodular polyhedra (Q2427694) (← links)
• A survey on models and algorithms for discrete evacuation planning network problems (Q2514655) (← links)
• Theory of Principal Partitions Revisited (Q2971607) (← links)
• An Introduction to Network Flows over Time (Q2971621) (← links)
• Maximum Throughput Network Routing Subject to Fair Flow Allocation (Q3195309) (← links)
• Fairness in Resource Allocation: Foundation and Applications (Q3294895) (← links)
• Optimal Multicommodity Flow Through the Complete Graph with Random Edge Capacities (Q3550999) (← links)
• Generalized lexicographically optimal flows in networks with multiple sources and sinks (Q3668257) (← links)
• Optimal sharing (Q3941156) (← links)
• A good algorithm for lexicographically optimal flows in multi-terminal networks (Q4126084) (← links)
• Engpässe, Staustellen und glatte homogene Ströme in Netzen (Q4168794) (← links)
• PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS (Q4818570) (← links)
• (Q5020876) (← links)
• Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints (Q5131701) (← links)
• A characterization of network representable polymatroids (Q5202490) (← links)
• A Parametrized Analysis of Algorithms on Hierarchical Graphs (Q5205039) (← links)
• Fairness in routing and load balancing (Q5952449) (← links)
• Combining fairness with throughput: Online routing with multiple objectives (Q5952452) (← links)