메뉴 건너뛰기




Volumn 33, Issue 1-2, 1997, Pages 43-46

Application of an heuristic procedure to solve mixed-integer programming problems

Author keywords

Dual simplex; Hooke and Jeeves algorithm; Mixed integer programming; Production planning; Simplex

Indexed keywords

HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING;

EID: 0031248383     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0360-8352(97)00037-5     Document Type: Article
Times cited : (5)

References (7)
  • 1
    • 0028434011 scopus 로고
    • Algorithms for real-time scheduling of jobs on mixed model assembly lines
    • Bolat, A., Savsar, M., and Al-Fawzan, M .1994. "Algorithms for real-time scheduling of jobs on mixed model assembly lines". Computers and Operations Research. Vol. 21 No.5. pp.487-498.
    • (1994) Computers and Operations Research , vol.21 , Issue.5 , pp. 487-498
    • Bolat, A.1    Savsar, M.2    Al-Fawzan, M.3
  • 3
    • 0014536423 scopus 로고
    • A bound -and-scan algorithm for pure integer linear programming with general variables
    • Hillier F. S. 1969. "A Bound -and-Scan Algorithm for Pure Integer Linear Programming with General Variables". Operations Research. Vol. 17. pp.600 -637.
    • (1969) Operations Research , vol.17 , pp. 600-637
    • Hillier, F.S.1
  • 4
    • 0029342044 scopus 로고
    • The scheduling problem where multiple machines compete for a common local buffer
    • Khosla, Y. 1995. "The scheduling problem where multiple machines compete for a common local buffer." European Journal of Operational Research. Vol. 84 No. 2. pp.330-342.
    • (1995) European Journal of Operational Research , vol.84 , Issue.2 , pp. 330-342
    • Khosla, Y.1
  • 6
    • 0002585787 scopus 로고
    • A heuristic ceiling point algorithm for general integer linear programming
    • Saltzman R. M. and Hillier F. S. 1992. "A Heuristic Ceiling Point Algorithm for General Integer Linear Programming". Management Science. Vol. 38, No. 2. pp.263-283.
    • (1992) Management Science , vol.38 , Issue.2 , pp. 263-283
    • Saltzman, R.M.1    Hillier, F.S.2
  • 7
    • 0006168826 scopus 로고    scopus 로고
    • A note on modeling multiple choice requirements for simple mixed integer programming solvers
    • Wlodzimierz O. 1996. "A Note on Modeling Multiple Choice Requirements for Simple Mixed Integer Programming Solvers". Computers and Operations Research. Vol. 23, No.2, pp. 199-205.
    • (1996) Computers and Operations Research , vol.23 , Issue.2 , pp. 199-205
    • Wlodzimierz, O.1


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