Pages that link to "Item:Q3290207"

The following pages link to An Application of Generalized Linear Programming to Network Flows (Q3290207):

Displaying 18 items.

• Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
• Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
• On the core of network synthesis games (Q757264) (← links)
• Integer version of the multipath flow network synthesis problem (Q1003728) (← links)
• A polynomial-time algorithm for message routing in hierarchical communication networks (Q1129965) (← links)
• Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
• On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic (Q1847145) (← links)
• Multi-terminal multipath flows: synthesis (Q1887053) (← links)
• The network synthesis problem in a cycle (Q1924616) (← links)
• A distributed method for optimal capacity reservation (Q2322374) (← links)
• The multi-layered network design problem (Q2370332) (← links)
• Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements (Q2468776) (← links)
• The sensitivity of a traffic network (Q2551066) (← links)
• On the robustness of potential-based flow networks (Q2689822) (← links)
• Network design and dynamic routing under queueing demand (Q3696826) (← links)
• A generalized linear production model: A unifying model (Q3743164) (← links)
• Synthesis of single-product networks (Q4747890) (← links)
• Beiträge zur Dekomposition von linearen Programmen (Q5521241) (← links)