Skip to main content

The Use of Ordinary Differential Equations in Quadratic Maximization with Integer Constraints

  • Chapter
State of the Art in Global Optimization

Abstract

We consider the problem of maximizing a quadratic function on the set { −1, l}n. This problem is related to some graph partitioning problems. We propose a path following method to compute an upper bound to the previous maximization problem. Numerical implementation of the proposed method and related numerical experience are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garey, M.R., Johnson, D.S., “Computers and Intractability: A Guide to the Theory of NP-Completeness,” W.H. Freeman, San Francisco, 1979.

    Google Scholar 

  2. Garey, M.R., Johnson, D.S., Stockmejer, L., “Some Simplified NP complete Graph Problems,” Theoretical Computer Science 1, 1976, pp. 237 - 267.

    Google Scholar 

  3. Pardalos, P.M., Wolkowicz, H., “Quadratic Assignment and Related Problems,” DIM ACS Series, American Mathematical Society 16, 1994.

    Google Scholar 

  4. Pardalos, P.M., Phillips, A.T., Rosen, J.B.,“Topics in Parallel Computing in Mathematical Programming,” Science Press, 1992.

    Google Scholar 

  5. Zirilli, F., “The Use of Ordinary Differential Equations in the Solution of Non Linear Systems of Equations,” Nonlinear Optimization, 19S1, M.T.D. Powell, Ed., Academic Press, New York. 19S2, pp. 39–7.

    Google Scholar 

  6. Kamath, A., Karmarkar, N., “A Continuous Approach to Compute Upper Bound in Quadratic Maximization Problems with Integer Constraints,” Recent Advances in Global Optimization, C.A. Floudas and P.M. Pardalos, Eds., Princeton University Press, Princeton N.J. ( USA ), 1991, pp. 125–140.

    Google Scholar 

  7. Herzel, S., Recchioni, M.C., Zirilli, F.,“ A Quadraticaliy Convergent Method for Linear Programming, ” Linear Algebra and Its Appl., 152, 1991, pp. 255–289.

    Google Scholar 

  8. Pardalos, P.M .,“Construction of Test Problems in Quadratic Bivalent Programming,” ACM Transactions on Mathematical Software 17, 1991, pp.74–87.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Kluwer Academic Publishers

About this chapter

Cite this chapter

Maponi, P., Recchioni, M.C., Zirilli, F. (1996). The Use of Ordinary Differential Equations in Quadratic Maximization with Integer Constraints. In: Floudas, C.A., Pardalos, P.M. (eds) State of the Art in Global Optimization. Nonconvex Optimization and Its Applications, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3437-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-3437-8_8

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-3439-2

  • Online ISBN: 978-1-4613-3437-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics