메뉴 건너뛰기




Volumn 2, Issue , 2002, Pages 308-311

A method for solving a class of mixed integer linear programming problem with block angular structure

Author keywords

Block Angular Structure; Interior Point Method; Mixed Integer Programming; Optimization

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

EID: 0036976805     PISSN: 08843627     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (1)

References (10)
  • 2
    • 0023862337 scopus 로고
    • A polynomial-time algorithm, based on Newton's method, for linear programming
    • J. Renegar, "A polynomial-time algorithm, based on Newton's method, for linear programming," Mathematical Programming, Vol.40, pp. 59-93, 1988
    • (1988) Mathematical Programming , vol.40 , pp. 59-93
    • Renegar, J.1
  • 3
    • 84947655945 scopus 로고
    • The interior-point method for linear programming
    • G. Astfalk and I. Lustig, R. Marsten and D. Shanno, "The interior-point method for linear programming, " IEEE Software, Vol. 9, No.4, pp. 61-68, 1992
    • (1992) IEEE Software , vol.9 , Issue.4 , pp. 61-68
    • Astfalk, G.1    Lustig, I.2    Marsten, R.3    Shanno, D.4
  • 4
    • 0001844689 scopus 로고
    • Data structures and programming techniques for the implementation of karmarkar's algorithm
    • I. Adler and N. Karmarkar, M. G. C. Resende and G. Veiga, "Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm, " ORSA Journal on Computing, Vol.1, No.2, pp. 84-106, 1989
    • (1989) ORSA Journal on Computing , vol.1 , Issue.2 , pp. 84-106
    • Adler, I.1    Karmarkar, N.2    Resende, M.G.C.3    Veiga, G.4
  • 5
    • 0026838079 scopus 로고
    • Implementations of affine scaling methods, approximate solutions of systems of linear equations using preconditioned conjugate gradient methods
    • S. Mehrotra, "Implementations of Affine Scaling Methods, Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods," ORSA Journal on Computing, Vol.4, No.2, pp.103-118, 1992
    • (1992) ORSA Journal on Computing , vol.4 , Issue.2 , pp. 103-118
    • Mehrotra, S.1
  • 6
    • 0026923017 scopus 로고
    • Very large-scale linear programming, A case study in combining interior point and simplex methods
    • R. E. Bixby and J. W. Gregory, I. J. Lustig, R. E. Marsten and D. F. Shanno, "Very large-scale linear programming, A case study in combining interior point and simplex methods," Operations Research, Vol.40, No.5, pp.885-897, 1992
    • (1992) Operations Research , vol.40 , Issue.5 , pp. 885-897
    • Bixby, R.E.1    Gregory, J.W.2    Lustig, I.J.3    Marsten, R.E.4    Shanno, D.F.5
  • 7
    • 0012933111 scopus 로고    scopus 로고
    • Speeding up Karmarkar's algorithm for multicommodity flows
    • S. Kapoor and P. M. Vaidya, "Speeding up Karmarkar's algorithm for multicommodity flows, " Mathematical Programming, Vol.73, No.1, pp. 111-127, 1996
    • (1996) Mathematical Programming , vol.73 , Issue.1 , pp. 111-127
    • Kapoor, S.1    Vaidya, P.M.2
  • 8
    • 0000561116 scopus 로고
    • On the implementation of a primal-dual interior point method
    • Sanjay Mehrotra, "On The Implementation of a Primal-Dual Interior Point Method," Society for Industrial and Applied Mathematics, pp. 575-601, 1992
    • (1992) Society for Industrial and Applied Mathematics , pp. 575-601
    • Mehrotra, S.1
  • 10
    • 34250077538 scopus 로고
    • Finding an interior point in the optimal face of linear programs
    • Sanjay Mehrotra and Yinyu Ye, "Finding an interior point in the optimal face of linear programs," Mathematical Programming, Vol. 62, pp. 497-515, 1993
    • (1993) Mathematical Programming , vol.62 , pp. 497-515
    • Mehrotra, S.1    Ye, Y.2


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