A discrete dynamic convexized method for the max-cut problem
type: Item
instance of: scholarly article
title: A discrete dynamic convexized method for the max-cut problem
zbMATH Open document ID: 1269.90130
author: Geng Lin
author: Wenxing Zhu
published in: Annals of Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6107362
zbMATH Keywords: max-cut problem
zbMATH Keywords: local search
zbMATH Keywords: dynamic convexized method
MaRDI profile type: Publication
full work available at URL: s10479-012-1133-2
OpenAlex ID: W2023809267
cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
cites work: Mixed linear and semidefinite programming for combinatorial and quadratic optimization
cites work: A projected gradient algorithm for solving the maxcut SDP relaxation
cites work: Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
cites work: Randomized heuristics for the Max-Cut problem
cites work: Some simplified NP-complete graph problems
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: An improved rounding method and semidefinite programming relaxation for graph partition
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: Lagrangian smoothing heuristics for Max-cut
cites work: Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems
cites work: A discrete filled function algorithm for approximate global solutions of max-cut problems
cites work: A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
cites work: P-Complete Approximation Problems
cites work: Q5440597
cites work: A continuation algorithm for max-cut problem
cites work: A discrete dynamic convexized method for nonlinear integer programming
cites work: Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
DOI: 10.1007/S10479-012-1133-2
Recommended article: A discrete filled function algorithm for approximate global solutions of max-cut problems
Recommended article: Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
Recommended article: A new discrete filled function method for solving large scale max-cut problems
Recommended article: A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
Recommended article: Q5440597
Recommended article: A continuation algorithm for max-cut problem
Recommended article: A novel formulation of the max-cut problem and related algorithm
Recommended article: A tight semidefinite relaxation of the MAX CUT problem
Recommended article: Q4607982
Recommended article: Cutting Plane Algorithm for Convex Generalized Disjunctive Programs
description: scientific article; zbMATH DE number 6107362