schliessen

Filtern

 

Bibliotheken

Cover Image

On strongly polynomial dual simplex algorithms for the maximum flow problem

Journal Title: Mathematical programming 1997, Vol.78 (2), p.159-168
Main Author: GOLDFARB, D
Other Authors: CHEN, W
Format: Electronic Article Electronic Article
Language: English
Subjects:
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Publisher: Heidelberg: Springer
ID: ISSN: 0025-5610
Link: http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2754808
Zum Text:
SendSend as email Add to Book BagAdd to Book Bag
Staff View
recordid: cdi_crossref_primary_10_1007_BF02614368
title: On strongly polynomial dual simplex algorithms for the maximum flow problem
format: Article
creator:
  • GOLDFARB, D
  • CHEN, W
subjects:
  • Applied sciences
  • Exact sciences and technology
  • Flows in networks. Combinatorial problems
  • Operational research and scientific management
  • Operational research. Management science
ispartof: Mathematical programming, 1997, Vol.78 (2), p.159-168
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.6880548
LOCALfalse
PrimoNMBib
record
control
sourceidpascalfrancis_cross
recordidTN_cdi_crossref_primary_10_1007_BF02614368
sourceformatXML
sourcesystemPC
sourcerecordid2754808
originalsourceidFETCH-LOGICAL-c209t-f31aa469ca5da480396ea75873e34a647c400d92a9c4c548b3565d5e6d7c9e470
addsrcrecordideNpFkD1PwzAYhC0EEqWw8As8MCEFXsefGaGigKjUBeboreO0QXYc2alo_z2tQLDcLc_dSUfINYM7BqDvH-dQKia4MidkcvRCKKFOyQSglIVUDM7JRc6fAMC4MRPytuxpHlPs135Ph-j3fQwdetpsD5K7MHi3o-jXMXXjJmTaxkTHjaMBd13YBtr6-EWHFFfehUty1qLP7urXp-Rj_vQ-eykWy-fX2cOisCVUY9FyhihUZVE2KAzwSjnU0mjuuEAltBUATVViZYWVwqy4VLKRTjXaVk5omJLbn16bYs7JtfWQuoBpXzOojzfU_zcc4JsfeMBs0bcJe9vlv0SpDwtg4BszHVxp
sourcetypeAggregation Database
isCDItrue
recordtypearticle
display
typearticle
titleOn strongly polynomial dual simplex algorithms for the maximum flow problem
creatorGOLDFARB, D ; CHEN, W
creatorcontribGOLDFARB, D ; CHEN, W
identifier
0ISSN: 0025-5610
1EISSN: 1436-4646
2DOI: 10.1007/BF02614368
3CODEN: MHPGA4
languageeng
publisherHeidelberg: Springer
subjectApplied sciences ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Operational research and scientific management ; Operational research. Management science
ispartofMathematical programming, 1997, Vol.78 (2), p.159-168
rights1997 INIST-CNRS
lds50peer_reviewed
citesFETCH-LOGICAL-c209t-f31aa469ca5da480396ea75873e34a647c400d92a9c4c548b3565d5e6d7c9e470
links
openurl$$Topenurl_article
thumbnail$$Usyndetics_thumb_exl
backlink$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2754808$$DView record in Pascal Francis
search
creatorcontrib
0GOLDFARB, D
1CHEN, W
title
0On strongly polynomial dual simplex algorithms for the maximum flow problem
1Mathematical programming
subject
0Applied sciences
1Exact sciences and technology
2Flows in networks. Combinatorial problems
3Operational research and scientific management
4Operational research. Management science
issn
00025-5610
11436-4646
fulltextfalse
rsrctypearticle
creationdate1997
recordtypearticle
recordideNpFkD1PwzAYhC0EEqWw8As8MCEFXsefGaGigKjUBeboreO0QXYc2alo_z2tQLDcLc_dSUfINYM7BqDvH-dQKia4MidkcvRCKKFOyQSglIVUDM7JRc6fAMC4MRPytuxpHlPs135Ph-j3fQwdetpsD5K7MHi3o-jXMXXjJmTaxkTHjaMBd13YBtr6-EWHFFfehUty1qLP7urXp-Rj_vQ-eykWy-fX2cOisCVUY9FyhihUZVE2KAzwSjnU0mjuuEAltBUATVViZYWVwqy4VLKRTjXaVk5omJLbn16bYs7JtfWQuoBpXzOojzfU_zcc4JsfeMBs0bcJe9vlv0SpDwtg4BszHVxp
startdate1997
enddate1997
creator
0GOLDFARB, D
1CHEN, W
generalSpringer
scope
0IQODW
1AAYXX
2CITATION
sort
creationdate1997
titleOn strongly polynomial dual simplex algorithms for the maximum flow problem
authorGOLDFARB, D ; CHEN, W
facets
frbrtype5
frbrgroupidcdi_FETCH-LOGICAL-c209t-f31aa469ca5da480396ea75873e34a647c400d92a9c4c548b3565d5e6d7c9e470
rsrctypearticles
prefilterarticles
languageeng
creationdate1997
topic
0Applied sciences
1Exact sciences and technology
2Flows in networks. Combinatorial problems
3Operational research and scientific management
4Operational research. Management science
toplevelpeer_reviewed
creatorcontrib
0GOLDFARB, D
1CHEN, W
collection
0Pascal-Francis
1CrossRef
jtitleMathematical programming
delivery
delcategoryRemote Search Resource
fulltextno_fulltext
addata
au
0GOLDFARB, D
1CHEN, W
formatjournal
genrearticle
ristypeJOUR
atitleOn strongly polynomial dual simplex algorithms for the maximum flow problem
jtitleMathematical programming
date1997
risdate1997
volume78
issue2
spage159
epage168
pages159-168
issn0025-5610
eissn1436-4646
codenMHPGA4
copHeidelberg
pubSpringer
doi10.1007/BF02614368