Canonical dual approach to solving the maximum cut problem
From MaRDI portal
Publication:693126
DOI10.1007/S10898-012-9881-8zbMATH Open1259.90154OpenAlexW2150779659WikidataQ57430342 ScholiaQ57430342MaRDI QIDQ693126FDOQ693126
Authors: Shu-Cherng Fang, Zhenbo Wang, David Y. Gao, Wenxun Xing 
Publication date: 7 December 2012
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-012-9881-8
Recommendations
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Computational approaches to MAX-cut
- A dual method for solving the canonical linear programming problem
- A novel formulation of the max-cut problem and related algorithm
- scientific article; zbMATH DE number 2190137
- scientific article; zbMATH DE number 426360
- A tight semidefinite relaxation of the MAX CUT problem
- Optimization and optimality test for the Max-Cut Problem
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- Max-cut under graph constraints
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- Duality principles in nonconvex systems. Theory, methods and applications
- Title not available (Why is that?)
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Canonical duality theory: connections between nonconvex mechanics and global optimization
- P-Complete Approximation Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm
- Solutions to quadratic minimization problems with box and integer constraints
- On the stability of a dual weak vector variational inequality problem
- Network Design Using Cut Inequalities
- Lagrange-type functions in constrained non-convex optimization.
- Perfect duality theory and complete solutions to a class of global optimization problems*
- The cut polytope and the Boolean quadric polytope
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- Global extremal conditions for multi-integer quadratic programming
- Title not available (Why is that?)
- Extended canonical duality and conic programming for solving 0-1 quadratic programming problems
Cited In (9)
- Global solutions to a class of CEC benchmark constrained optimization problems
- A canonical duality approach for the solution of affine quasi-variational inequalities
- Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions
- Canonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale Systems
- Global optimal trajectory in chaos and NP-hardness
- Canonical duality for solving general nonconvex constrained problems
- Maximum cut in fuzzy nature: models and algorithms
- Canonical Dual Solutions to Quadratic Optimization over One Quadratic Constraint
- On topology optimization and canonical duality method
Uses Software
This page was built for publication: Canonical dual approach to solving the maximum cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693126)
