论文信息 - Upper-bounds for quadratic 0-1 maximization - 字舞流文

Upper-bounds for quadratic 0-1 maximization

Y. Crama | P. Hammer | E. Boros

[1] Caterina De Simone,et al. The cut polytope and the Boolean quadric polytope , 1990, Discret. Math..

[2] Manfred W. Padberg,et al. The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..

[3] Egon Balas,et al. Nonlinear 0–1 programming: I. Linearization techniques , 1984, Math. Program..

[4] Pierre Hansen,et al. Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..

[5] Egon Balas,et al. Nonlinear 0–1 programming: II. Dominance relations and algorithms , 1983, Math. Program..

[6] M. Garey. Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

[7] P. Hansen. Methods of Nonlinear 0-1 Programming , 1979 .

[8] Michael Randolph Garey,et al. Johnson: "computers and intractability , 1979 .

[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .