The indefinite zero-one quadratic problem

@article{Carter1984TheIZ,
  title={The indefinite zero-one quadratic problem},
  author={Michael W. Carter},
  journal={Discrete Applied Mathematics},
  year={1984},
  volume={7},
  pages={23-44}
}
A method is described for transforming an indefinite O-1 quadratic programming problem into an equivalent positive definite problem of precisely the same size. Several variations of the basic transformation are incorporated in a branch and bound algorithm. This technique is combined with a system of analytical bounds on the variables. Computational results on several hundred random test problems with up to 30 variables demonstrate that the (polynomial bounded) transformation together with the… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Combinatorial aspects of certain control topics, Ph.D

  • A. Vannelli
  • 1983

Quadratic knapsack problems , Math

  • W. Murray
  • Programming Study
  • 1980

Yormark, An implicit enumeration algorithm for quadratic integer programming, Management Science

  • J. S. B51-B60. R.D. McBride
  • Ph.D. thesis,
  • 1980

Integer quadratic programming: A continuous approach, Ph.D

  • M. W. Carter
  • Quadratic knapsack problems, Math. Programming…
  • 1979

Converting the O-l polynomial programming problem to a O-l linear program, Operations Research

  • F. Glover, E. Woolsey
  • Quadratic O-l programming,
  • 1974

Converting the Ol polynomial programming problem to a Ol linear program

  • E. Woolsey
  • Operations Research
  • 1973

A balasian-based algorithm for zero-one polynomial programming, Management

  • A. H. Taha
  • Science Application Series
  • 1972

Similar Papers

Loading similar papers…