Profiles
Research Units
Publications
Sign Up
Faculty Login
X
Journal Article
The problem of maximum flow with minimum attainable cost in a network
Ahmed N
,
Das S
,
Purusotham S
Published in Springer Science and Business Media LLC
2013
DOI:
10.1007/s12597-012-0106-1
Volume: 50
Issue: 2
Pages: 197 - 214
Request full-text
Cite
Content may be subject to copyright.
Figures & Tables (21)
References (14)
Journal Details
Authors (1)
About the journal
Journal
Data powered by Typeset
OPSEARCH
Publisher
Data powered by Typeset
Springer Science and Business Media LLC
ISSN
0030-3887
Open Access
0
Authors (1)
Purusotham S
Department of Mathematics
School of Advanced Sciences
Vellore Campus
Recent publications
An exact algorithm fork-cardinality degree constrained clustered minimum spanning tree problem
An ISO/IEC 24745 compliant ECG template protection based on linear prediction coding
The problem of maximum flow with minimum attainable cost in a network
An Articulation Point-Based Approximation Algorithm for Minimum Vertex Cover Problem
Get all the updates for this publication
Follow