Pages that link to "Item:Q3337975"

The following pages link to Optimal dynamic routing in communication networks with continuous traffic (Q3337975):

Displaying 19 items.

• Scheduling arc maintenance jobs in a network to maximize total flow over time (Q406493) (← links)
• A linear programming approach to routing control in networks of constrained linear positive systems (Q445883) (← links)
• Earliest arrival flows in networks with multiple sinks (Q496688) (← links)
• The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths (Q741538) (← links)
• Average flow constraints and stabilizability in uncertain production-distribution systems (Q848734) (← links)
• A survey of dynamic network flows (Q917417) (← links)
• A simplex based algorithm to solve separated continuous linear programs (Q930346) (← links)
• Complexity analysis for maximum flow problems with arc reversals (Q965819) (← links)
• Fenchel duality and smoothness of solution of the optimal routing problem (Q1080359) (← links)
• Efficient continuous-time dynamic network flow algorithms (Q1306377) (← links)
• Solution algorithms for a class of continuous linear programs with fuzzy valued objective functions (Q1933386) (← links)
• A heuristic algorithm for the earliest arrival flow with multiple sources (Q2016467) (← links)
• Continuous dynamic contraflow approach for evacuation planning (Q2399339) (← links)
• A survey on models and algorithms for discrete evacuation planning network problems (Q2514655) (← links)
• Universally maximum flow with piecewise-constant capacities (Q2764994) (← links)
• An Introduction to Network Flows over Time (Q2971621) (← links)
• Traffic Networks and Flows over Time (Q3637317) (← links)
• (Q5020876) (← links)
• Lexicographically optimal earliest arrival flows (Q6068531) (← links)