Abstract
One of the problems that is naturally reduced to a quadratic boolean programming is the maximum cut problem (the max-cut problem).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Shor, N.Z. (1998). Semidefinite Programming Bounds for Extremal Graph Problems. In: Nondifferentiable Optimization and Polynomial Problems. Nonconvex Optimization and Its Applications, vol 24. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6015-6_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6015-6_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4792-5
Online ISBN: 978-1-4757-6015-6
eBook Packages: Springer Book Archive