Generalized max flow in series–parallel graphs-Reference-Cited by-同舟云学术

Generalized max flow in series–parallel graphs

Published:2013-05 Issue:2 Volume:10 Page:155-162
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Krumke Sven O.,Zeck Christiane

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference13 articles.

1. K. Beygang, Modelle und Algorithmen für die Leerwagendisposition im Schienengüterverkehr, Master’s Thesis, TU Kaiserslautern, Germany, 2008 (in German).

2. B. Engels, S.O. Krumke, R. Schrader, C. Zeck, Integer flow with multipliers: the special case of multipliers 1 and 2, in: CTW, 2009, pp. 239–243.

3. A new polynomial time algorithm for linear programming;Karmarkar;Combinatorica,1984

4. A polynomial time algorithm in linear programming;Khachiyan;Doklady Akademii Nauk SSSR,1979

5. Dynamic programming of optimum flows in lossy communication nets;Onaga;IEEE Transactions on Circuit Theory,1966

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Method for Finding the Maximum Dynamic Flow in Periodic Fuzzy Graphs;2024 International Conference on Industrial Engineering, Applications and Manufacturing (ICIEAM);2024-05-20

2. The price of Anarchy in series-parallel network congestion games;Mathematical Programming;2022-04-26

3. A note on integral generalized flows in directed partial 2-trees;Information Processing Letters;2021-12

4. Cross–series–parallel digraphs;Discrete Applied Mathematics;2021-11

5. Adaptation of Random Binomial Graphs for Testing Network Flow Problems Algorithms;Mathematics;2021-07-21