schliessen

Filtern

 

Bibliotheken

A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time

Journal Title: Mathematical programming 1990-05, Vol.47 (1-3), p.353-365
Main Author: Goldfarb, Donald
Other Authors: Hao, Jianxiu
Format: Electronic Article Electronic Article
Language: English
ID: ISSN: 0025-5610
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: cdi_crossref_primary_10_1007_BF01580869
title: A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time
format: Article
creator:
  • Goldfarb, Donald
  • Hao, Jianxiu
ispartof: Mathematical programming, 1990-05, Vol.47 (1-3), p.353-365
description:
language: eng
source:
identifier: ISSN: 0025-5610
fulltext: no_fulltext
issn:
  • 0025-5610
  • 1436-4646
url: Link


@attributes
NO1
SEARCH_ENGINEprimo_central_multiple_fe
SEARCH_ENGINE_TYPEPrimo Central Search Engine
RANK1.4967288
LOCALfalse
PrimoNMBib
record
control
sourceidcrossref
recordidTN_cdi_crossref_primary_10_1007_BF01580869
sourceformatXML
sourcesystemPC
sourcerecordid10_1007_BF01580869
originalsourceidFETCH-LOGICAL-c769-8c5d514159fab14a3fcfa2ef02bccac3cef74dfd77857fc2bc9ec0de9fc65bb80
addsrcrecordideNptkF9LwzAUxYMoOKcvfoL7qEL1pm3S9HGOTYXBXvZe0jRxkaQZTZzz21v_gCA-3cPldw6cQ8glxVuKWN3dL5EygYLXR2RCy4JnJS_5MZkg5ixjnOIpOYvxBRFpIcSE6BnsBuulg2j9zukDSPccBpu2HtJWJojB7XUctQYvD9a_ejAuvI2u0DrtwfYwUj7E1HvY2X1IEWTfwfqqhxz8NSTr9Tk5MdJFffFzp2SzXGzmj9lq_fA0n60yVfE6E4p1jJaU1Ua2tJSFUUbm2mDeKiVVobSpys50VSVYZdT4rbXCTtdGcda2Aqfk5jtWDSHGQZvmq9vw3lBsPvdpfvcZYfwDK5tksqFPg7TuP8sHvjJpZA
sourcetypeAggregation Database
isCDItrue
recordtypearticle
display
typearticle
titleA primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time
creatorGoldfarb, Donald ; Hao, Jianxiu
creatorcontribGoldfarb, Donald ; Hao, Jianxiu
identifier
0ISSN: 0025-5610
1EISSN: 1436-4646
2DOI: 10.1007/BF01580869
languageeng
ispartofMathematical programming, 1990-05, Vol.47 (1-3), p.353-365
lds50peer_reviewed
citedbyFETCH-LOGICAL-c769-8c5d514159fab14a3fcfa2ef02bccac3cef74dfd77857fc2bc9ec0de9fc65bb80
citesFETCH-LOGICAL-c769-8c5d514159fab14a3fcfa2ef02bccac3cef74dfd77857fc2bc9ec0de9fc65bb80
links
openurl$$Topenurl_article
thumbnail$$Usyndetics_thumb_exl
search
creatorcontrib
0Goldfarb, Donald
1Hao, Jianxiu
title
0A primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time
1Mathematical programming
issn
00025-5610
11436-4646
fulltextfalse
rsrctypearticle
creationdate1990
recordtypearticle
recordideNptkF9LwzAUxYMoOKcvfoL7qEL1pm3S9HGOTYXBXvZe0jRxkaQZTZzz21v_gCA-3cPldw6cQ8glxVuKWN3dL5EygYLXR2RCy4JnJS_5MZkg5ixjnOIpOYvxBRFpIcSE6BnsBuulg2j9zukDSPccBpu2HtJWJojB7XUctQYvD9a_ejAuvI2u0DrtwfYwUj7E1HvY2X1IEWTfwfqqhxz8NSTr9Tk5MdJFffFzp2SzXGzmj9lq_fA0n60yVfE6E4p1jJaU1Ua2tJSFUUbm2mDeKiVVobSpys50VSVYZdT4rbXCTtdGcda2Aqfk5jtWDSHGQZvmq9vw3lBsPvdpfvcZYfwDK5tksqFPg7TuP8sHvjJpZA
startdate199005
enddate199005
creator
0Goldfarb, Donald
1Hao, Jianxiu
scope
0AAYXX
1CITATION
sort
creationdate199005
titleA primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time
authorGoldfarb, Donald ; Hao, Jianxiu
facets
frbrtype5
frbrgroupidcdi_FETCH-LOGICAL-c769-8c5d514159fab14a3fcfa2ef02bccac3cef74dfd77857fc2bc9ec0de9fc65bb80
rsrctypearticles
prefilterarticles
languageeng
creationdate1990
toplevelpeer_reviewed
creatorcontrib
0Goldfarb, Donald
1Hao, Jianxiu
collectionCrossRef
jtitleMathematical programming
delivery
delcategoryRemote Search Resource
fulltextno_fulltext
addata
au
0Goldfarb, Donald
1Hao, Jianxiu
formatjournal
genrearticle
ristypeJOUR
atitleA primal simplex algorithm that solves the maximum flow problem in at mostnm pivots and O(n 2 m) time
jtitleMathematical programming
date1990-05
risdate1990
volume47
issue1-3
spage353
epage365
pages353-365
issn0025-5610
eissn1436-4646
doi10.1007/BF01580869