New quadratic models for the maximum weighted cut problem
- 30 Downloads
New quadratic models are proposed to improve the upper-bound estimates in the maximum weighted cut problem. They are found by two original methods for deriving redundant quadratic constraints. A well-known linear model is shown to follow from the models proposed. Recommendations on how to develop its strengthened analogs are given.
Keywordsmaximum weighted cut problem quadratic model Lagrangian dual quadratic estimate functionally redundant quadratic constraints
Unable to display preview. Download preview PDF.
- 1.M. G. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness, W. H. Freeman & Co., San Francisco (1979).Google Scholar
- 2.N. Z. Shor, Nondifferentiable Optimization and Polynomial Problems, Kluwer, Dordrecht (1998).Google Scholar
- 7.M. Laurent and F. Rendl, “Semidefinite programming and integer programming,” in: Rep. CWI, PNA-R0210, Amsterdam (2002).Google Scholar
- 8.M. Grotschel, L. Lovasz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin (1988).Google Scholar