메뉴 건너뛰기




Volumn 32, Issue 6, 2004, Pages 517-522

A new linearization technique for multi-quadratic 0-1 programming problems

Author keywords

Linear mixed 0 1 programming; Linearization; Multi quadratic 0 1 programming; Quadratic 0 1 programming

Indexed keywords

CONSTRAINT THEORY; INTEGER PROGRAMMING; LINEARIZATION; NUMERICAL METHODS; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

EID: 3042732867     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.03.005     Document Type: Article
Times cited : (64)

References (15)
  • 1
    • 0025405388 scopus 로고
    • Linearization strategies for a class of zero-one mixed integer programming problems
    • Adams W.P., Sherali H.D. Linearization strategies for a class of zero-one mixed integer programming problems. Oper. Res. 2(38):1990;217-226.
    • (1990) Oper. Res. , vol.2 , Issue.38 , pp. 217-226
    • Adams, W.P.1    Sherali, H.D.2
  • 2
    • 0002854108 scopus 로고
    • Quadratic optimization
    • R. Horst, & P.M. Pardalos. Dordrecht: Kluwer Academic Publishers
    • Floudas C.A., Visweswaran V. Quadratic optimization. Horst R., Pardalos P.M. Handbook of Global Optimization. 1995;217-269 Kluwer Academic Publishers, Dordrecht.
    • (1995) Handbook of Global Optimization , pp. 217-269
    • Floudas, C.A.1    Visweswaran, V.2
  • 3
    • 0001383406 scopus 로고
    • Further reduction of zero-one polynomial programs to zero-one linear programming
    • Glover F., Woolsey E. Further reduction of zero-one polynomial programs to zero-one linear programming. Oper. Res. 1(21):1973;156-161.
    • (1973) Oper. Res. , vol.1 , Issue.21 , pp. 156-161
    • Glover, F.1    Woolsey, E.2
  • 4
    • 0001189913 scopus 로고
    • Converting the 0-1 polynomial programming program to a 0-1 linear program
    • Glover F., Woolsey E. Converting the 0-1 polynomial programming program to a 0-1 linear program. Oper. Res. 1(22):1974;180-182.
    • (1974) Oper. Res. , vol.1 , Issue.22 , pp. 180-182
    • Glover, F.1    Woolsey, E.2
  • 5
    • 77957783608 scopus 로고
    • Methods of nonlinear 0-1 programming
    • Hansen P. Methods of nonlinear 0-1 programming. Ann. Discrete Math. 5:1979;53-70.
    • (1979) Ann. Discrete Math. , vol.5 , pp. 53-70
    • Hansen, P.1
  • 7
    • 0026115796 scopus 로고
    • Construction of test problems in quadratic bivalent programming
    • Pardalos P.M. Construction of test problems in quadratic bivalent programming. ACM Trans. Math. Software. 17:1991;74-87.
    • (1991) ACM Trans. Math. Software , vol.17 , pp. 74-87
    • Pardalos, P.M.1
  • 9
    • 0002285568 scopus 로고    scopus 로고
    • Quadratic binary programming and dynamic system approach to determine the predictability of epileptic seizures
    • Pardalos P.M., Iasemidis L.D., Shiau D.-S., Sackellares J.C. Quadratic binary programming and dynamic system approach to determine the predictability of epileptic seizures. J. Combin. Optimization. 5/1:2001;9-26.
    • (2001) J. Combin. Optimization , vol.5 , Issue.1 , pp. 9-26
    • Pardalos, P.M.1    Iasemidis, L.D.2    Shiau, D.-S.3    Sackellares, J.C.4
  • 11
    • 3042768720 scopus 로고
    • Graph separation techniques for quadratic zero-one programming
    • Pardalos P.M., Jha S. Graph separation techniques for quadratic zero-one programming. Comput. Math. Appl. 21(6/7):1991;107-113.
    • (1991) Comput. Math. Appl. , vol.21 , Issue.6-7 , pp. 107-113
    • Pardalos, P.M.1    Jha, S.2
  • 12
    • 38249013747 scopus 로고
    • Complexity of uniqueness and local search in quadratic 0-1 programming
    • Pardalos P.M., Jha S. Complexity of uniqueness and local search in quadratic 0-1 programming. Oper. Res. Lett. 11:1992;119-123.
    • (1992) Oper. Res. Lett. , vol.11 , pp. 119-123
    • Pardalos, P.M.1    Jha, S.2
  • 13
    • 0025673487 scopus 로고
    • Computational aspects of a branch and bound algorithm for quadratic 0-1 programming
    • Pardalos P.M., Rodgers G.P. Computational aspects of a branch and bound algorithm for quadratic 0-1 programming. Computing. 45:1990;131-144.
    • (1990) Computing , vol.45 , pp. 131-144
    • Pardalos, P.M.1    Rodgers, G.P.2
  • 14
    • 0000176856 scopus 로고
    • Parallel branch and bound algorithm for quadratic zero-one on a hypercube architecture
    • Pardalos P.M., Rodgers G.P. Parallel branch and bound algorithm for quadratic zero-one on a hypercube architecture. Ann. Oper. Res. 22:1990;271-292.
    • (1990) Ann. Oper. Res. , vol.22 , pp. 271-292
    • Pardalos, P.M.1    Rodgers, G.P.2
  • 15
    • 0005638765 scopus 로고
    • Reduction of integer polynomial programming to zero-one linear programming problems
    • Watters L.J. Reduction of integer polynomial programming to zero-one linear programming problems. Oper. Res. 15:1967;1171-1174.
    • (1967) Oper. Res. , vol.15 , pp. 1171-1174
    • Watters, L.J.1


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