Canonical dual approach to solving the maximum cut problem
From MaRDI portal
Publication:693126
DOI10.1007/s10898-012-9881-8zbMath1259.90154OpenAlexW2150779659WikidataQ57430342 ScholiaQ57430342MaRDI QIDQ693126
Shu-Cherng Fang, Wen-Xun Xing, Zhen-bo Wang, David Yang Gao
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
Related Items
Global solutions to a class of CEC benchmark constrained optimization problems ⋮ Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions ⋮ A canonical duality approach for the solution of affine quasi-variational inequalities ⋮ Canonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale Systems ⋮ On topology optimization and canonical duality method ⋮ Canonical duality for solving general nonconvex constrained problems ⋮ Global Optimal Trajectory in Chaos and NP-Hardness ⋮ Canonical Dual Solutions to Quadratic Optimization over One Quadratic Constraint
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
- Extended canonical duality and conic programming for solving 0-1 quadratic programming problems
- Solutions to quadratic minimization problems with box and integer constraints
- On the stability of a dual weak vector variational inequality problem
- Global extremal conditions for multi-integer quadratic programming
- Lagrange-type functions in constrained non-convex optimization.
- The cut polytope and the Boolean quadric polytope
- Duality principles in nonconvex systems. Theory, methods and applications
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- TSPLIB—A Traveling Salesman Problem Library
- P-Complete Approximation Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Perfect duality theory and complete solutions to a class of global optimization problems*
- Network Design Using Cut Inequalities
- Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
