• Reference Citation Analysis
  • v
  • v
  • Find an Article
Find an Article PDF (4610646)   Today's Articles (293)   Subscriber (49380)
For: RinnooyKan A, Telgen J. The complexity of linear programming. STAT NEERL 1981. [DOI: 10.1111/j.1467-9574.1981.tb00717.x] [Citation(s) in RCA: 11] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [What about the content of this article? (0)] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/27/2022]
Number Cited by Other Article(s)
1
Gerards A, Kolen A. Polyhedral Combinatorics in Combinatorial Optimization. STAT NEERL 1987. [DOI: 10.1111/j.1467-9574.1987.tb01168.x] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/27/2022]
2
Borgwardt KH. The Average number of pivot steps required by the Simplex-Method is polynomial. ACTA ACUST UNITED AC 1982. [DOI: 10.1007/bf01917108] [Citation(s) in RCA: 47] [Impact Index Per Article: 1.1] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 12/01/2022]
PrevPage 1 of 1 1Next
© 2004-2024 Baishideng Publishing Group Inc. All rights reserved. 7041 Koll Center Parkway, Suite 160, Pleasanton, CA 94566, USA