Engpässe, Staustellen und glatte homogene Ströme in Netzen

DOI10.1007/BF01917661zbMath0386.90059OpenAlexW1996932045MaRDI QIDQ4168794

H. Steckhan

Publication date: 1978

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01917661

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (1)

Engpässe, Staustellen und glatte homogene Ströme in Netzen Eine Alternative zu Steckhan's Konzept

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Transient flows in networks
• Maximal Flow Through a Network
• A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
• The Use of Wye-Delta Transformations in Network Simplification
• Multi-Terminal Network Flows
• Optimal flows in networks with multiple sources and sinks
• Devisenarbitrage als Flußprobleme
• Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
• Analyzing Multi-Commodity Distribution Networks Having Milling-in-Transit Features
• Finding the n Most Vital Links in Flow Networks
• On building minimum cost communication networks
• The Operator-Scheduling Problem: A Network-Flow Approach
• Optimal expansion of an existing network
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
• Dynamic Inventory Models and Stochastic Programming
• Maximal Flow in a Multi-Terminal Network with Any One Arc Subject to Failure
• An Algorithm for Universal Maximal Dynamic Flows in a Network
• A Note on Parametric Network Flows
• Parametric Network Flows
• On the equivalence of some generalized network problems to pure network problems

This page was built for publication: Engpässe, Staustellen und glatte homogene Ströme in Netzen