A lower bound on the average number of pivot-steps for solving linear programs valid for all variants of the simplex-algorithm

Saved in:
Bibliographic Details
Published in:Mathematical methods of operations research (Heidelberg, Germany) Vol. 49; no. 2; pp. 175 - 210
Main Authors: BORGWARDT, K. H, HUHN, P
Format: Journal Article
Language:English
Published: Heidelberg Physica 01.01.1999
Subjects:
ISSN:1432-2994
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Author BORGWARDT, K. H
HUHN, P
Author_xml – sequence: 1
  givenname: K. H
  surname: BORGWARDT
  fullname: BORGWARDT, K. H
  organization: Universität Augsburg, Institut für Mathematik, Universitätsstr. 14, 86159 Augsburg, Germany
– sequence: 2
  givenname: P
  surname: HUHN
  fullname: HUHN, P
  organization: Universität Augsburg, Institut für Mathematik, Universitätsstr. 14, 86159 Augsburg, Germany
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1892083$$DView record in Pascal Francis
BookMark eNotjDtPwzAYRT0UibawM3pgNfiVxBmrikelSiwwV19iOzVy7MhOAyz8dlJguvfqXJ0VWoQYDEI3jN4xSqv7zFRJWF3XRIlKkGKBlkwKTnhdy0u0yvmdUsqk5Ev0vcE-fpiEm3gKGseAx6PBMJkEncHh1DczixYPboojyaMZMrYx4Rz95EKHvQsGEh5S7BL0GU_gnf59gPfzSg7CmM-Gsze7fvDmk4DvYnLjsb9CFxZ8Ntf_uUZvjw-v22eyf3nabTd70nEpR8LKtqpKXtiiVZJaIVtVFkqBLLTgc6HcGqsBSigta0zTaCgsFUZpTVujGrFGt3_eAXIL3iYIrcuHIbke0teBqZpTJcQPoQtj8w
ContentType Journal Article
Copyright 1999 INIST-CNRS
Copyright_xml – notice: 1999 INIST-CNRS
DBID IQODW
DOI 10.1007/s186-1999-8373-5
DatabaseName Pascal-Francis
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Applied Sciences
Computer Science
Business
EndPage 210
ExternalDocumentID 1892083
GroupedDBID -Y2
-~X
.4S
.86
.DC
.VR
06D
0R~
0VY
1N0
203
28-
29M
29R
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
7WY
8AO
8FE
8FG
8FL
8TC
8UJ
8VB
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAPKM
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBRH
ABBXA
ABDBE
ABDZT
ABECU
ABFSG
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABRTQ
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSTC
ACYUM
ACZOJ
ADHIR
ADHKG
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADXHL
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMOZ
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AEZWR
AFBBN
AFDZB
AFEXP
AFGCZ
AFHIU
AFKRA
AFLOW
AFOHR
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGQPQ
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHPBZ
AHQJS
AHSBF
AHWEU
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AIXLP
AJBLW
AJRNO
AJZVZ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMVHM
AMXSW
AMYLF
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
ATHPR
AVWKF
AXYYD
AYFIA
AYJHY
AZFZN
AZQEC
B-.
BA0
BAPOH
BBWZM
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EBA
EBE
EBLON
EBO
EBR
EBS
EBU
ECS
EDO
EIOEI
EJD
EMK
EOH
EPL
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ7
GQ8
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I-F
IHE
IJ-
IKXTQ
IQODW
ITM
IWAJR
IXC
IXE
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K1G
K60
K6V
K6~
K7-
KDC
KOV
KOW
L6V
LAS
LLZTM
M0C
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O-J
O9-
O93
O9G
O9I
O9J
OAM
P19
P2P
P62
P9R
PF0
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PQQKQ
PROAC
PT4
PT5
PTHSS
Q2X
QOK
QOS
QWB
R-Y
R89
R9I
RHV
RIG
RNI
RNS
ROL
RPX
RSV
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCF
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TH9
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
ZL0
ZMTXR
ZWQNP
~8M
~EX
ID FETCH-LOGICAL-g244t-16c77625f5c840f34c86588a45d3258802fefdaa6a6f1bebbda5f03e8dd0ce8b3
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000080032300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1432-2994
IngestDate Mon Jul 21 09:15:34 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Geometry
Lower bound
Stochastic model
Linear programming
Simplex method
Algorithm complexity
Language English
License CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-g244t-16c77625f5c840f34c86588a45d3258802fefdaa6a6f1bebbda5f03e8dd0ce8b3
PageCount 36
ParticipantIDs pascalfrancis_primary_1892083
PublicationCentury 1900
PublicationDate 1999-01-01
PublicationDateYYYYMMDD 1999-01-01
PublicationDate_xml – month: 01
  year: 1999
  text: 1999-01-01
  day: 01
PublicationDecade 1990
PublicationPlace Heidelberg
PublicationPlace_xml – name: Heidelberg
PublicationTitle Mathematical methods of operations research (Heidelberg, Germany)
PublicationYear 1999
Publisher Physica
Publisher_xml – name: Physica
SSID ssj0001442
Score 1.5055531
SourceID pascalfrancis
SourceType Index Database
StartPage 175
SubjectTerms Applied sciences
Exact sciences and technology
Mathematical programming
Operational research and scientific management
Operational research. Management science
Title A lower bound on the average number of pivot-steps for solving linear programs valid for all variants of the simplex-algorithm
Volume 49
WOSCitedRecordID wos000080032300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLink Standard
  issn: 1432-2994
  databaseCode: RSV
  dateStart: 19970101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  omitProxy: false
  ssIdentifier: ssj0001442
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lj9MwELbKghAceBTQ8ljkA7fIKLXzcI7luRfKqnRhbyvHjncjhaRqslW58Hv4mYwfabO7B-DAJUrjdOJkPnlmPC-EXumE0jBTksSag4GSRynJmEiILJRMJZU0THPbbCKdzfjJSXY0Gv3qc2HWVVrXfLPJlv-V1XANmG1SZ_-B3VuicAHOgelwBLbD8a8YPw0q0_ksyE3DJO8LCAS8honOcQ1AbJhzuW46Ajxe2ooMAUzK7i0YtdOUv3ZxW20AUyuVi7WsKvgFb-AjZwzdtjTVhTdEVGfNquzOvw-V3U_bkrA2RcW0qrZ_bJbFykfg-VpD50bR3ZXccpv1Jp3hx2Cn4s3n-cdv0_m7hV2cXg_SKo4PZ7tUNeVz-rIrWxhHDpGDVThilICcjIbLtKts6uFIB2vuxLVe8eKbuijZa5Ih9JnSPCF2CmCYMxLvpGDv-b8iHLchixOeUVBXb6CbNI0zEzw4__J1K_PBLLV-9X7i3iHukjQvP9JE34oWPrx2nVMG6sziAbrn7RA8dfh5iEZFPUb3vU2C_YrfjtHtPjMCRvsOIP3wGN0dlLN8hH5OsYUettDDTY2B_9hDDzvo4UbjAfQwAAt76GEHPdxDD1vo2TsAeriHnqFg6F6D3mN0_OH94u0h8f09yBkolR2ZJDIFWRzrWPIo1CySHPRhLqJYMQonIdWFVkIkItGTvMhzJWIdsoIrFcqC5-wJ2qubuthHGAZipqUyXsVIsjDLY6AtWJqzCRNcP0UHlz766dLVcjn1bH32h_Hn6M4OuC_QXre6KA7QLbnuynb10mLhNyJRlEs
linkProvider Springer Nature
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+lower+bound+on+the+average+number+of+pivot-steps+for+solving+linear+programs+valid+for+all+variants+of+the+simplex-algorithm&rft.jtitle=Mathematical+methods+of+operations+research+%28Heidelberg%2C+Germany%29&rft.au=BORGWARDT%2C+K.+H&rft.au=HUHN%2C+P&rft.date=1999-01-01&rft.pub=Physica&rft.issn=1432-2994&rft.volume=49&rft.issue=2&rft.spage=175&rft.epage=210&rft_id=info:doi/10.1007%2Fs186-1999-8373-5&rft.externalDBID=n%2Fa&rft.externalDocID=1892083
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1432-2994&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1432-2994&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1432-2994&client=summon