New quadratic models for the maximum weighted cut problem

DOI10.1007/s10559-006-0037-zzbMath1125.90055OpenAlexW1988348878MaRDI QIDQ2501328

Yanyan Li

Publication date: 6 September 2006

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-006-0037-z

zbMATH Keywords

quadratic modelfunctionally redundant quadratic constraintsLagrangian dual quadratic estimatemaximum weighted cut problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

On the accuracy of dual bounds for quadratic extremum problems ⋮ Models and information technologies for decision support during structural and technological changes ⋮ Optimization problems for the maximum \(k\)-plex

Cites Work

• Unnamed Item
• Unnamed Item
• Functionally redundant constraints for Boolean quadratic-type optimization problems
• Laplacian eigenvalues and the maximum cut problem
• Nondifferentiable optimization and polynomial problems
• New algorithms for the weighted maximum cut problem on graphs
• On the cut polytope

This page was built for publication: New quadratic models for the maximum weighted cut problem