A new discrete filled function method for solving large scale max-cut problems
DOI10.1007/S11075-011-9522-1zbMATH Open1257.65030OpenAlexW1995413378MaRDI QIDQ438797FDOQ438797
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
Recommendations
- A discrete filled function algorithm for approximate global solutions of max-cut problems
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
- Discrete filled function method for discrete global optimization
- A discrete dynamic convexized method for the max-cut problem
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
combinatorial optimizationglobal optimizationnumerical experimentsundirected graphmax-cut problemfilled function
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- A filled function method for finding a global minimizer of a function of several variables
- A Spectral Bundle Method for Semidefinite Programming
- Some simplified NP-complete graph problems
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Lagrangian smoothing heuristics for Max-cut
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Filled functions for unconstrained global optimization.
- A new filled function method for global optimization
- Randomized heuristics for the Max-Cut problem
- Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems
- Discrete filled function method for discrete global optimization
- Title not available (Why is that?)
- A new filled function method for nonlinear integer programming problem
- A filled function method for finding a global minimizer on global integer optimization
- A continuous approach to nonlinear integer programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- An approximate algorithm for nonlinear integer programming
- Finding global minima with a computable filled function.
Cited In (3)
Uses Software
This page was built for publication: A new discrete filled function method for solving large scale max-cut problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438797)
