메뉴 건너뛰기




Volumn 74, Issue 2, 1997, Pages 135-146

A lower bound for a constrained quadratic 0-1 minimization problem

Author keywords

Constrained zero one quadratic programming; Linear programming; Lower bound; Roof duality

Indexed keywords


EID: 0043136269     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00026-1     Document Type: Article
Times cited : (11)

References (15)
  • 1
    • 0041503818 scopus 로고
    • Unconstrained 0-1 optimization and Lagrangean relaxation
    • W.P. Adams, A. Billionnet and A. Sutter, Unconstrained 0-1 optimization and Lagrangean relaxation, Discrete Appl. Math. 29 (1990) 131-142.
    • (1990) Discrete Appl. Math. , vol.29 , pp. 131-142
    • Adams, W.P.1    Billionnet, A.2    Sutter, A.3
  • 2
    • 0022122146 scopus 로고
    • Maximizing a supermodular pseudo-Boolean function: A polynomial algorithm for supermodular cubic functions
    • A. Billionnet and M. Minoux, Maximizing a supermodular pseudo-Boolean function: a polynomial algorithm for supermodular cubic functions, Discrete Appl. Math. 12 (1985) 1-11.
    • (1985) Discrete Appl. Math. , vol.12 , pp. 1-11
    • Billionnet, A.1    Minoux, M.2
  • 3
    • 0025404444 scopus 로고
    • Upper bounds for quadratic 0-1 maximization
    • E. Boros, Y. Crama and P.L. Hammer, Upper bounds for quadratic 0-1 maximization, Oper. Res. Lett. 9 (1990) 73-79.
    • (1990) Oper. Res. Lett. , vol.9 , pp. 73-79
    • Boros, E.1    Crama, Y.2    Hammer, P.L.3
  • 4
    • 0043006548 scopus 로고
    • Chvatal cuts and odd cycle inequalities in quadratic 0-1 optimization
    • E. Boros, Y .Crama and P.L. Hammer, Chvatal cuts and odd cycle inequalities in quadratic 0-1 optimization, SIAM J. Discrete Math. 5 (2) (1992), 163-177.
    • (1992) SIAM J. Discrete Math. , vol.5 , Issue.2 , pp. 163-177
    • Boros, E.1    Crama, Y.2    Hammer, P.L.3
  • 5
    • 0024682227 scopus 로고
    • Recognition problems for special classes of polynomials in 0-1 variables
    • Y .Crama, Recognition problems for special classes of polynomials in 0-1 variables, Math. Programming 44 (1989) 139-155.
    • (1989) Math. Programming , vol.44 , pp. 139-155
    • Crama, Y.1
  • 6
    • 38249018098 scopus 로고
    • The basic algorithm for pseudo-Boolean programming revisited
    • Y. Crama, P. Hansen and B. Jaumard, The basic algorithm for pseudo-Boolean programming revisited. Discrete Appl. Math. 29 (1990) 171-185.
    • (1990) Discrete Appl. Math. , vol.29 , pp. 171-185
    • Crama, Y.1    Hansen, P.2    Jaumard, B.3
  • 7
    • 0021376406 scopus 로고
    • Roof duality, complementation and persistency in quadratic 0-1 optimization
    • P.L. Hammer, P. Hansen and B. Simeone, Roof duality, complementation and persistency in quadratic 0-1 optimization, Math. Programming, 28 (1984) 121-155.
    • (1984) Math. Programming , vol.28 , pp. 121-155
    • Hammer, P.L.1    Hansen, P.2    Simeone, B.3
  • 10
    • 38249018380 scopus 로고
    • On the equivalence of paved-duality and standard linearization in nonlinear optimization
    • P. Hansen, S.H. Lu and B. Simeone, On the equivalence of paved-duality and standard linearization in nonlinear optimization. Discrete Appl. Math. 29 (1990) 187-193.
    • (1990) Discrete Appl. Math. , vol.29 , pp. 187-193
    • Hansen, P.1    Lu, S.H.2    Simeone, B.3
  • 11
    • 0002716901 scopus 로고
    • Submodular functions and convexity
    • A. Bachem et al. eds, Springer, Berlin
    • L. Lovasz, Submodular functions and convexity, In: A. Bachem et al. eds, Mathematical Programming: The State of the Art (Springer, Berlin 1983) 235-257.
    • (1983) Mathematical Programming: The State of the Art , pp. 235-257
    • Lovasz, L.1
  • 12
    • 0023348858 scopus 로고
    • Roof duality for 0-1 nonlinear optimization
    • S.H. Lu and A.C. Williams, Roof duality for 0-1 nonlinear optimization, Math. Programming, 37 (1987) 357-360.
    • (1987) Math. Programming , vol.37 , pp. 357-360
    • Lu, S.H.1    Williams, A.C.2
  • 13
    • 0024718137 scopus 로고
    • The Boolean quadric polytope: Some characteristics, facets and relatives
    • M. Padberg, The Boolean quadric polytope: some characteristics, facets and relatives, Math. Programming 45 (1989) 139-172.
    • (1989) Math. Programming , vol.45 , pp. 139-172
    • Padberg, M.1
  • 14
    • 0016565825 scopus 로고
    • Minimum cuts and related problems
    • J.C. Picard and H.D. Ratliff, Minimum cuts and related problems, Networks 5 (1975) 357-370.
    • (1975) Networks , vol.5 , pp. 357-370
    • Picard, J.C.1    Ratliff, H.D.2
  • 15


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