메뉴 건너뛰기
European Journal of Operational Research
Volumn 119, Issue 3, 1999, Pages 671-677
Optimality cut for mixed integer linear programs
Author keywords

[No Author keywords available]
Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; INTEGER PROGRAMMING; RELAXATION PROCESSES; THEOREM PROVING;
EID: 0033320655     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00357-9     Document Type: Article
Times cited : (1)
References (10)
  • 1
    • 56449107505 scopus 로고
    • OR-library: Distributing test problems by electronic mail
    • Beasley J.E. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society. 41:1990;1069-1072.
    • (1990) Journal of the Operational Research Society , vol.41 , pp. 1069-1072
    • Beasley, J.E.1
  • 2
    • 0001917497 scopus 로고    scopus 로고
    • Branch-and-cut algorithms
    • In: Dell'Amico, M., Maffioli F., Martello, S. (Eds.), Wiley, Chichester
    • Caprara, A., Fischetti, M., 1997. Branch-and-cut algorithms. In: Dell'Amico, M., Maffioli F., Martello, S. (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester, 45-63.
    • (1997) Annotated Bibliographies in Combinatorial Optimization , pp. 45-63
    • Caprara, A.1    Fischetti, M.2
  • 3
    • 0003697647 scopus 로고
    • CPLEX, Optimization Inc. Incline Village, NV
    • CPLEX, 1995. Optimization Inc. Using the CPLEX Callable Library, Incline Village, NV.
    • (1995) Using the CPLEX Callable Library
  • 5
    • 0002707458 scopus 로고
    • An algorithm for integer solutions to linear problems
    • In: Graves, R.L., Wolfe, P. (Eds.), McGraw Hill, New York
    • Gomory, R.E., 1963. An algorithm for integer solutions to linear problems. In: Graves, R.L., Wolfe, P. (Eds.), Recent Advances in Mathematical Programming, McGraw Hill, New York, 269-302.
    • (1963) Recent Advances in Mathematical Programming , pp. 269-302
    • Gomory, R.E.1
  • 6
    • 0026220441 scopus 로고
    • Solution of large-scale symmetric traveling salesman problems
    • Grötschel M., Holland O. Solution of large-scale symmetric traveling salesman problems. Mathematical Programming. 51:1991;141-202.
    • (1991) Mathematical Programming , vol.51 , pp. 141-202
    • Grötschel, M.1    Holland, O.2
  • 7
    • 0015989127 scopus 로고
    • NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum - cost flow network problems
    • Klingman D., Napier A., Stutz J. NETGEN: A program for generating large scale capacitated assignment, transportation, and minimum - cost flow network problems. Management Science. 20:1974;814-821.
    • (1974) Management Science , vol.20 , pp. 814-821
    • Klingman, D.1    Napier, A.2    Stutz, J.3
  • 8
    • 0000415520 scopus 로고
    • The integer L-shaped method for stochastic integer programs
    • Laporte G., Louveaux F.V. The integer L-shaped method for stochastic integer programs. Operations Research Letters. 13:1993;133-142.
    • (1993) Operations Research Letters , vol.13 , pp. 133-142
    • Laporte, G.1    Louveaux, F.V.2
  • 10
    • 0025448140 scopus 로고
    • Facet identification for the symmetric traveling salesman problem
    • Padberg M.W., Rinaldi G. Facet identification for the symmetric traveling salesman problem. Mathematical Programming. 47:1990;219-257.
    • (1990) Mathematical Programming , vol.47 , pp. 219-257
    • Padberg, M.W.1    Rinaldi, G.2

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