New quadratic models for the maximum weighted cut problem

DOI10.1007/S10559-006-0037-ZMaRDI QIDQ2501328zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• New algorithms for the weighted maximum cut problem on graphs
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
• From Graph Orientation to the Unweighted Maximum Cut
• Improved semidefinite bounding procedure for solving max-cut problems to optimality
• A novel formulation of the max-cut problem and related algorithm

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Functionally redundant constraints for Boolean quadratic-type optimization problems
• Laplacian eigenvalues and the maximum cut problem
• New algorithms for the weighted maximum cut problem on graphs
• Nondifferentiable optimization and polynomial problems
• On the cut polytope
• Semidefinite programming and integer programming

Cited in

(6)

• Models and information technologies for decision support during structural and technological changes
• Optimization problems for the maximum \(k\)-plex
• Optimal allocation problem with quadratic utility functions and its relationship with graph cut problem
• New algorithms for the weighted maximum cut problem on graphs
• On the accuracy of dual bounds for quadratic extremum problems
• scientific article; zbMATH DE number 7525500 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2501328)