Devisenarbitrage als Flußprobleme
From MaRDI portal
Publication:4055358
DOI10.1007/BF01957167zbMath0301.90010MaRDI QIDQ4055358
Publication date: 1975
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Mathematical economics (91B99)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Two new algorithms for minimal cost flow problems
- Zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen
- ALGOL-Prozeduren für zwei Verfahren zur Suche negativer Zyklen in bewerteten Digraphen
- On a routing problem
- New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- Implementation and efficiency of Moore-algorithms for the shortest route problem
- A Direct Search Method to Locate Negative Cycles in a Graph
- Optimal Flow In A Network With Gains*