REFERENCES
- S A Cook, The complexity of theorem proving procedures, Proc 3rd Annual ACM Symp Theory of Computing, ACM, New York, pp 151–158, 1971.
- R M Karp, Reducibility among combinatorial problems, in Complexity of Computer Computation (R E Miller & J W Thatcher eds), Plenum press, New York, 1972, pp 85–103.
- H V Simon, Continuous reductions among combinatorial optimization problems, Acta Information, vol 26, pp 771–785, 1989.
- M Balinski, On a selection Problem, Management Science, vol 7. pp 230–231, 1970.
- J Rhys, A Selection problem of Shared fixed costs and networks, Management Science, vol 7, pp 200–207, 1970.
- J Picard & D Ratliff, Minimum cuts and related problems, Networks, vol 5, pp 357–370, 1975.
- P Hansen, Methods for nonlinear 0–1 programming, Annals of Discrete Mathematics, vol 5, pp 53–70, 1979.
- E Balas & J Mazzola, Nonlinear 0–1 programming, Parts 1 and 2, Mathematical Programming, vol 30, pp 1–45, 1984.
- A Williams, Quadratic 0–1 programming using the Roof dual method with computational results, RUTCOR Report, Rutgers University, New Brunswick NJ, pp 8–85, 1985.
- F Baronha, M Junger & G Reinhalt, Experiments in quadratic 0–1 programming, Report 7, Institut fur Mathematick Universitat, Augsburg, 1985.
- J J Hopfield & D W Tank, Neural computation of decisions in optimization problems, Biol Cybernetics, vol 52, pp 141–152, 1985.