A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
type: Item
instance of: scholarly article
title: A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
zbMATH Open document ID: 1159.90475
author: Feng-Min Xu
author: Ai-Fan Ling
author: Cheng-Xian Xu
published in: European Journal of Operational Research
publication date: 2009-04-30T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5549990
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: global optimization
zbMATH Keywords: filled function
zbMATH Keywords: max-cut
zbMATH Keywords: continuation method
zbMATH Keywords: local search
describes a project that uses: Outward rotations
describes a project that uses: CirCut
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.07.026
OpenAlex ID: W1991198724
cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
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: A filled function method for finding a global minimizer of a function of several variables
cites work: A continuous approach to nonlinear integer programming
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: Q4142699
cites work: A class of augmented filled functions
cites work: Discrete global descent method for discrete global optimization and nonlinear integer programming
cites work: Discrete filled function method for discrete global optimization
cites work: A filled function method for finding a global minimizer on global integer optimization
cites work: Q5440597
cites work: Filled functions for unconstrained global optimization.
cites work: Q5716604
cites work: A survey of quasi-Newton equations and quasi-Newton methods for optimization
cites work: A new discrete filled function algorithm for discrete global optimization
cites work: Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems
DOI: 10.1016/J.EJOR.2008.07.026
description: scientific article; zbMATH DE number 5549990