ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
Approaches to Min-Cost Flow Problems
Lecture Notes in Economics and Mathematical Systems - Programming in Networks and Graphs
◽
10.1007/978-3-642-51713-6_7
◽
1988
◽
pp. 78-107
Author(s):
Ulrich Derigs
Keyword(s):
Flow Problems
◽
Cost Flow
◽
Min Cost Flow
Download Full-text
Related Documents
Cited By
References
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
INFORMS Journal on Computing
◽
10.1287/ijoc.11.4.370
◽
1999
◽
Vol 11
(4)
◽
pp. 370-393
◽
Cited By ~ 57
Author(s):
Antonio Frangioni
◽
Giorgio Gallo
Keyword(s):
Flow Problems
◽
Dual Ascent
◽
Cost Flow
◽
Min Cost Flow
Download Full-text
Prim-based support-graph preconditioners for min-cost flow problems
Computational Optimization and Applications
◽
10.1007/s10589-006-9005-9
◽
2007
◽
Vol 36
(2-3)
◽
pp. 271-287
◽
Cited By ~ 6
Author(s):
A. Frangioni
◽
C. Gentile
Keyword(s):
Flow Problems
◽
Cost Flow
◽
Min Cost Flow
Download Full-text
A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
INFORMS Journal on Computing
◽
10.1287/ijoc.1040.0081
◽
2006
◽
Vol 18
(1)
◽
pp. 61-70
◽
Cited By ~ 27
Author(s):
Antonio Frangioni
◽
Antonio Manca
Keyword(s):
Computational Study
◽
Flow Problems
◽
Cost Flow
◽
Min Cost Flow
Download Full-text
Improved min-cost flow scheduler for mesh-based P2P streaming system
2009 IEEE International Conference on Multimedia and Expo
◽
10.1109/icme.2009.5202696
◽
2009
◽
Author(s):
Chun-Yuan Chang
◽
Ti-Chia Chiu
◽
You-Ming Chen
◽
Ming-Hung Chen
◽
Cheng-Fu Chou
Keyword(s):
P2p Streaming
◽
Cost Flow
◽
Min Cost Flow
Download Full-text
Two new algorithms for minimal cost flow problems
Computing
◽
10.1007/bf02252916
◽
1973
◽
Vol 11
(3)
◽
pp. 275-285
◽
Cited By ~ 7
Author(s):
W. Domschke
Keyword(s):
Minimal Cost
◽
Flow Problems
◽
Cost Flow
◽
New Algorithms
◽
Minimal Cost Flow
Download Full-text
Mathematical Equivalence of the Auction Algorithm for Assignment and the ∊-Relaxation (Preflow-Push) Method for Min Cost Flow
Large Scale Optimization
◽
10.1007/978-1-4613-3632-7_2
◽
1994
◽
pp. 26-44
◽
Cited By ~ 1
Author(s):
Dimitri P. Bertsekas
Keyword(s):
Auction Algorithm
◽
Cost Flow
◽
Mathematical Equivalence
◽
Min Cost Flow
Download Full-text
FollowMe: Efficient Online Min-Cost Flow Tracking with Bounded Memory and Computation
2015 IEEE International Conference on Computer Vision (ICCV)
◽
10.1109/iccv.2015.496
◽
2015
◽
Cited By ~ 38
Author(s):
Philip Lenz
◽
Andreas Geiger
◽
Raquel Urtasun
Keyword(s):
Bounded Memory
◽
Cost Flow
◽
Min Cost Flow
Download Full-text
A novel min-cost flow method for estimating transcript expression with RNA-Seq
BMC Bioinformatics
◽
10.1186/1471-2105-14-s5-s15
◽
2013
◽
Vol 14
(S5)
◽
Cited By ~ 33
Author(s):
Alexandru I Tomescu
◽
Anna Kuosmanen
◽
Romeo Rizzi
◽
Veli Mäkinen
Keyword(s):
Transcript Expression
◽
Rna Seq
◽
Flow Method
◽
Cost Flow
◽
Min Cost Flow
Download Full-text
Minimum-Cost Flow Problems
Algorithmic Aspects of Flows in Networks
◽
10.1007/978-94-011-3444-6_4
◽
1991
◽
pp. 44-62
Author(s):
Günther Ruhe
Keyword(s):
Minimum Cost
◽
Minimum Cost Flow
◽
Flow Problems
◽
Cost Flow
◽
Minimum Cost Flow Problems
Download Full-text
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series—parallel networks
Mathematical Programming
◽
10.1007/bf01581240
◽
1993
◽
Vol 59
(1-3)
◽
pp. 117-132
◽
Cited By ~ 24
Author(s):
Arie Tamir
Keyword(s):
Polynomial Algorithm
◽
Strongly Polynomial Algorithm
◽
Flow Problems
◽
Quadratic Cost
◽
Parallel Networks
◽
Cost Flow
◽
Strongly Polynomial
Download Full-text
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close