A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
From MaRDI portal
Publication:1014949
DOI10.1016/j.ejor.2008.07.026zbMath1159.90475MaRDI QIDQ1014949
Ai-Fan Ling, Cheng-Xian Xu, Feng-Min Xu
Publication date: 30 April 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.07.026
global optimization; combinatorial optimization; local search; continuation method; max-cut; filled function
90C27: Combinatorial optimization
Related Items
Maximum cut in fuzzy nature: models and algorithms, Approximation algorithms for MAX RES CUT with limited unbalanced constraints, A note on ``A continuous approach to nonlinear integer programming, A discrete dynamic convexized method for the max-cut problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A filled function method for finding a global minimizer on global integer optimization
- A new discrete filled function algorithm for discrete global optimization
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- A filled function method for finding a global minimizer of a function of several variables
- Some simplified NP-complete graph problems
- A continuous approach to nonlinear integer programming
- Discrete filled function method for discrete global optimization
- A class of augmented filled functions
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Outward rotations
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Randomized heuristics for the Max-Cut problem
- A Spectral Bundle Method for Semidefinite Programming
- Filled functions for unconstrained global optimization.
- A survey of quasi-Newton equations and quasi-Newton methods for optimization
