메뉴 건너뛰기




Volumn 124, Issue 1-4, 2003, Pages 193-203

A general pricing scheme for the simplex method

Author keywords

[No Author keywords available]

Indexed keywords


EID: 3543010849     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000004769.36807.cf     Document Type: Article
Times cited : (4)

References (16)
  • 1
    • 0000388972 scopus 로고
    • The efficient solution of large-scale linear programming problems
    • Benichou, M., J. Gautier, G. Hentges, and G. Ribiere. (1977). "The Efficient Solution of Large-Scale Linear Programming Problems." Mathematical Programming 13, 280-322.
    • (1977) Mathematical Programming , vol.13 , pp. 280-322
    • Benichou, M.1    Gautier, J.2    Hentges, G.3    Ribiere, G.4
  • 2
    • 0000652462 scopus 로고
    • New finite pivot rule for the simplex method
    • Bland, R. (1977). "New Finite Pivot Rule for the Simplex Method." Mathematics of Operations Research 2, 103-107.
    • (1977) Mathematics of Operations Research , vol.2 , pp. 103-107
    • Bland, R.1
  • 3
    • 0016472959 scopus 로고
    • Analysis of mathematical programming problems prior to applying the simplex method
    • Brearley, A., G. Mitra, and H. Williams. (1975). "Analysis of Mathematical Programming Problems Prior to Applying the Simplex Method." Mathematical Programming 8, 54-83.
    • (1975) Mathematical Programming , vol.8 , pp. 54-83
    • Brearley, A.1    Mitra, G.2    Williams, H.3
  • 4
    • 0003193595 scopus 로고
    • Dynamic factorization in large-scale optimization
    • Brown, G. and M. Olson. (1994). "Dynamic Factorization in Large-Scale Optimization." Mathematical Programming 64, 17-51.
    • (1994) Mathematical Programming , vol.64 , pp. 17-51
    • Brown, G.1    Olson, M.2
  • 5
    • 0018464747 scopus 로고
    • Theoretical properties of the network simplex method
    • Cunningham, W. (1979). "Theoretical Properties of the Network Simplex Method." Mathematics of Operations Research 4(2), 196-208.
    • (1979) Mathematics of Operations Research , vol.4 , Issue.2 , pp. 196-208
    • Cunningham, W.1
  • 7
    • 0027114508 scopus 로고
    • Steepest edge simplex algorithms for linear programming
    • Forrest, J. and D. Goldfarb. (1992). "Steepest Edge Simplex Algorithms for Linear Programming." Mathematical Programming 57(3), 341-374.
    • (1992) Mathematical Programming , vol.57 , Issue.3 , pp. 341-374
    • Forrest, J.1    Goldfarb, D.2
  • 8
    • 0020736601 scopus 로고
    • Solving staircase linear programs by the simplex method, 2: Pricing
    • Fourer, R. (1983). "Solving Staircase Linear Programs by the Simplex Method, 2: Pricing." Mathematical Programming 25, 251-292.
    • (1983) Mathematical Programming , vol.25 , pp. 251-292
    • Fourer, R.1
  • 9
    • 0000726097 scopus 로고
    • A practicable steepest-edge simplex algorithm
    • Goldfarb, D. and J. Reid. (1977). "A Practicable Steepest-Edge Simplex Algorithm." Mathematical Programming 12, 361-371.
    • (1977) Mathematical Programming , vol.12 , pp. 361-371
    • Goldfarb, D.1    Reid, J.2
  • 10
    • 0003050215 scopus 로고
    • Pivot selection tactics
    • H. Greenberg (ed.), NATO ASI. Rockville, MD: Sijthoff & Nordhoff
    • Greenberg, H. (1978). "Pivot Selection Tactics." In H. Greenberg (ed.), Design and Implementation of Optimization Software, NATO ASI. Rockville, MD: Sijthoff & Nordhoff, pp. 143-174.
    • (1978) Design and Implementation of Optimization Software , pp. 143-174
    • Greenberg, H.1
  • 12
    • 0002825455 scopus 로고
    • Pivot selection method of the devex LP code
    • Harris, P. (1973). "Pivot Selection Method of the Devex LP Code." Mathematical Programming 5, 1-28.
    • (1973) Mathematical Programming , vol.5 , pp. 1-28
    • Harris, P.1
  • 14
    • 3543005195 scopus 로고    scopus 로고
    • International Series in Operations Research and Management. Boston, MA: Kluwer Academic Publishers
    • Maros, I. (2003). Computational Techniques of the Simplex Method. International Series in Operations Research and Management, Vol. 61. Boston, MA: Kluwer Academic Publishers.
    • (2003) Computational Techniques of the Simplex Method , vol.61
    • Maros, I.1
  • 15
    • 0033892277 scopus 로고    scopus 로고
    • Investigating the sparse simplex algorithm on a distributed memory multiprocessor
    • Maros, I. and G. Mitra. (2000). "Investigating the Sparse Simplex Algorithm on a Distributed Memory Multiprocessor." Parallel Computing 26, 151-170.
    • (2000) Parallel Computing , vol.26 , pp. 151-170
    • Maros, I.1    Mitra, G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.