A new discrete filled function method for solving large scale max-cut problems

DOI10.1007/s11075-011-9522-1zbMath1257.65030OpenAlexW1995413378MaRDI QIDQ438797

Ai-Fan Ling, Cheng-Xian Xu

Publication date: 31 July 2012

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11075-011-9522-1

zbMATH Keywords

global optimizationnumerical experimentscombinatorial optimizationundirected graphmax-cut problemfilled function

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items (2)

Non parameter-filled function for global optimization ⋮ Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem

Uses Software

• Matlab
• SDPpack
• CirCut
• Outward rotations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A filled function method for finding a global minimizer on global integer optimization
• 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 new filled function method for nonlinear integer programming problem
• Lagrangian smoothing heuristics for Max-cut
• 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
• An approximate algorithm for nonlinear integer programming
• A new filled function method for global optimization
• Finding global minima with a computable filled function.
• Filled functions for unconstrained global optimization.

This page was built for publication: A new discrete filled function method for solving large scale max-cut problems