메뉴 건너뛰기




Volumn 109, Issue 1, 2007, Pages 55-68

Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem

Author keywords

Convex quadratic relaxation; Experiments; Integer programming; Max cut; Quadratic 0 1 optimization; Semidefinite positive relaxation

Indexed keywords

COMPUTATIONAL METHODS; EXPERIMENTS; FUNCTIONS; OPTIMIZATION; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

EID: 33845295475     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-005-0637-9     Document Type: Article
Times cited : (147)

References (29)
  • 2
    • 56449107505 scopus 로고
    • Or-library: Distributing test problems by electronic mail
    • Beasley, J.E.: Or-library: Distributing test problems by electronic mail. J. Oper. Res. Soc. 41 (11), 1069-1072 (1990)
    • (1990) J. Oper. Res. Soc. , vol.41 , Issue.11 , pp. 1069-1072
    • Beasley, J.E.1
  • 3
  • 4
    • 33845300465 scopus 로고    scopus 로고
    • Boros, E., Hammer, P.L., Tavares, G.: The pseudo-boolean optimization website, 2005. http://rutcor.rutgers.edu/~pbo/index.htm
    • (2005)
    • Boros, E.1    Hammer, P.L.2    Tavares, G.3
  • 8
    • 0032026737 scopus 로고    scopus 로고
    • Adaptive memory tabu search for binary quadratic programs
    • Glover, F., Kochenberger, G.A., Alidaee, B. : Adaptive memory tabu search for binary quadratic programs. Manag. Sci. 44, 336-345 (1998)
    • (1998) Manag. Sci. , vol.44 , pp. 336-345
    • Glover, F.1    Kochenberger, G.A.2    Alidaee, B.3
  • 10
    • 0021376406 scopus 로고
    • Roof duality complementation and persistency in quadratic 0-1 optimization
    • Hammer, P.L., Hansen, P., Simeone, B.: Roof duality complementation and persistency in quadratic 0-1 optimization. Math. Prog. 28, 121-155 (1984)
    • (1984) Math. Prog. , vol.28 , pp. 121-155
    • Hammer, P.L.1    Hansen, P.2    Simeone, B.3
  • 13
    • 0041353723 scopus 로고    scopus 로고
    • Solving quadratic (01)-problems by semidefinite programs and cutting planes
    • Helmberg, C., Rendl, F.: Solving quadratic (01)-problems by semidefinite programs and cutting planes. Math. Prog. 82, 291-315 (1998)
    • (1998) Math. Prog. , vol.82 , pp. 291-315
    • Helmberg, C.1    Rendl, F.2
  • 14
    • 0034415006 scopus 로고    scopus 로고
    • A spectral bundle method for semidefinite programming
    • Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10 (3), 673-696 (2000)
    • (2000) SIAM J. Optim. , vol.10 , Issue.3 , pp. 673-696
    • Helmberg, C.1    Rendl, F.2
  • 15
    • 0002285568 scopus 로고    scopus 로고
    • Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
    • Iasemidis, L.D., Pardalos, P.M., Sackellares, J.C., Shiau, D.-S.: Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures. J. Combinatorial Optim. 5(1), 9-26 (2001)
    • (2001) J. Combinatorial Optim. , vol.5 , Issue.1 , pp. 9-26
    • Iasemidis, L.D.1    Pardalos, P.M.2    Sackellares, J.C.3    Shiau, D.-S.4
  • 16
    • 1542307073 scopus 로고    scopus 로고
    • ILOG ILOG CPLEX Division, Gentilly, France
    • ILOG. ILOG CPLEX 8.0 Reference Manual. ILOG CPLEX Division, Gentilly, France, 2002
    • (2002) ILOG CPLEX 8.0 Reference Manual
  • 17
    • 0036455609 scopus 로고    scopus 로고
    • Second order cone programming relaxation of nonconvex quadratic optimization problems
    • Kim, S., Kojima, M.: Second order cone programming relaxation of nonconvex quadratic optimization problems. Optim. Meth. Software 15, 201-224 (2001)
    • (2001) Optim. Meth. Software , vol.15 , pp. 201-224
    • Kim, S.1    Kojima, M.2
  • 18
    • 84963455348 scopus 로고
    • A tight bound for the Boolean quadratic optimization problem and its use in a branch and bound algorithm
    • Köner, F.: A tight bound for the Boolean quadratic optimization problem and its use in a branch and bound algorithm. Optim. 19 (5), 711-721 (1988)
    • (1988) Optim. , vol.19 , Issue.5 , pp. 711-721
    • Köner, F.1
  • 19
    • 33746352139 scopus 로고
    • Zur effektiven Löung von Booleschen, quadratischen Optimierungsproblemen
    • Köner, F., Richter, C.: Zur effektiven Löung von Booleschen, quadratischen Optimierungsproblemen. Numerische Mathematik 40, 99-109 (1982)
    • (1982) Numerische Mathematik , vol.40 , pp. 99-109
    • Köner, F.1    Richter, C.2
  • 20
    • 33747607092 scopus 로고
    • Polynomial solvability of convex quadratic programming
    • Kozlov, M.K., Tarasov, S.P., Khachiyan, L.G.: Polynomial solvability of convex quadratic programming. Doklady Akademii Nauk SSSR, 248 (5), 1049-1051 (1979).
    • (1979) Doklady Akademii Nauk SSSR , vol.248 , Issue.5 , pp. 1049-1051
    • Kozlov, M.K.1    Tarasov, S.P.2    Khachiyan, L.G.3
  • 21
    • 0141968029 scopus 로고
    • See also, Soviet Mathematics Doklady volume 20, 1108-1111 (1979)
    • (1979) Soviet Mathematics Doklady , vol.20 , pp. 1108-1111
  • 22
    • 33947667140 scopus 로고    scopus 로고
    • SDP relaxations in combinatorial optimization from a Lagrangian point of view
    • Lemaréchal, C., Oustry, F.: Hadjisavvas, N., Pardalos, P.M. (ed.)
    • Lemaréchal, C., Oustry, F.: Hadjisavvas, N., Pardalos, P.M. (ed.) SDP relaxations in combinatorial optimization from a Lagrangian point of view Advances in Convex Analysis and Global Optimization Kluwer, 2001, pp. 119-134
    • (2001) Advances in Convex Analysis and Global Optimization Kluwer , pp. 119-134
  • 23
    • 0018986924 scopus 로고
    • An implicit enumeration algoritlim for quadratic integer programming
    • McBride, R., Yormark, J. : An implicit enumeration algoritlim for quadratic integer programming. Manag. Sci. 26, 282-296 (1980)
    • (1980) Manag. Sci. , vol.26 , pp. 282-296
    • McBride, R.1    Yormark, J.2
  • 24
    • 8844265379 scopus 로고    scopus 로고
    • Memetic algorithms for the unconstrained binary quadratic programming problem
    • Merz, P., Katayama, K.: Memetic algorithms for the unconstrained binary quadratic programming problem. BioSyst. 78 (1-3), 99-118 (2004)
    • (2004) BioSyst. , vol.78 , Issue.1-3 , pp. 99-118
    • Merz, P.1    Katayama, K.2
  • 25
    • 0242324790 scopus 로고    scopus 로고
    • A new second order cone programming relaxation for max-cut problems
    • Muramatsu, M., Suzuki, T.: A new second order cone programming relaxation for max-cut problems. J. Oper. Res. Soc. of Japan 46, 164-177 (2003)
    • (2003) J. Oper. Res. Soc. of Japan , vol.46 , pp. 164-177
    • Muramatsu, M.1    Suzuki, T.2
  • 26
    • 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. Comput. 45, 131-144 (1990)
    • (1990) Comput. , vol.45 , pp. 131-144
    • Pardalos, P.M.1    Rodgers, G.P.2
  • 27
    • 0007166769 scopus 로고
    • Convex relaxations of (01)-quadratic programming
    • Poljak, S., Wolkowicz, H.: Convex relaxations of (01)-quadratic programming. Math. Oper. Res. 20, 550-561 (1995)
    • (1995) Math. Oper. Res. , vol.20 , pp. 550-561
    • Poljak, S.1    Wolkowicz, H.2
  • 28
    • 0002821681 scopus 로고
    • A recipe for semidefinite relaxation for (01)-quadratic programming
    • Poljak, S., Rendl, F., Wolkowicz, H.: A recipe for semidefinite relaxation for (01)-quadratic programming. J. Global Optim. 7, 51-73 (1995)
    • (1995) J. Global Optim. , vol.7 , pp. 51-73
    • Poljak, S.1    Rendl, F.2    Wolkowicz, H.3
  • 29
    • 0000604097 scopus 로고
    • Class of global minimum bounds of polynomial functions
    • Shor, N.Z.: Class of global minimum bounds of polynomial functions. Cybernetics 236, 731-734 (1987)
    • (1987) Cybernetics , vol.236 , pp. 731-734
    • Shor, N.Z.1


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