论文信息 - HEURISTICS WITH A WORST-CASE BOUND FOR UNCONSTRAINED QUADRATIC 0-1 PROGRAMMING - 字舞流文

HEURISTICS WITH A WORST-CASE BOUND FOR UNCONSTRAINED QUADRATIC 0-1 PROGRAMMING

[1] Gintaras Palubeckis. Quadratic 0-1 optimization , 1990 .

[2] J. C. Hennet,et al. Resolution of a quadratic combinatorial problem by dynamic programming , 1982 .

[3] P. Hammer,et al. Quadratic knapsack problems , 1980 .

[4] Panos M. Pardalos,et al. Complexity of uniqueness and local search in quadratic 0-1 programming , 1992, Oper. Res. Lett..

[5] Eitan Zemel. Measuring the Quality of Approximate Solutions to Zero-One Programming Problems , 1981, Math. Oper. Res..

[6] Michael W. Carter,et al. The indefinite zero-one quadratic problem , 1984, Discret. Appl. Math..

[7] Michael Jünger,et al. Experiments in quadratic 0–1 programming , 1989, Math. Program..

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

[9] Claus Richter,et al. Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen , 1982 .

[10] A. K. Mittal,et al. Unconstrained quadratic bivalent programming problem , 1984 .

[11] R. McBride,et al. An Implicit Enumeration Algorithm for Quadratic Integer Programming , 1980 .