Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
From MaRDI portal
Publication:489116
DOI10.1007/s40305-014-0045-zzbMath1307.90190OpenAlexW2014299902MaRDI QIDQ489116
Publication date: 27 January 2015
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40305-014-0045-z
Uses Software
Cites Work
- Unnamed Item
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Memetic search for the max-bisection problem
- A new discrete filled function method for solving large scale max-cut problems
- Solving the maxcut problem by the global equilibrium search
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- A hybrid metaheuristic approach to solving the UBQP problem
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Conjugate conflict continuation graphs for multi-layer constrained via minimization
- A discrete filled function algorithm for approximate global solutions of max-cut problems
- A discrete dynamic convexized method for nonlinear integer programming
- Hybridizing the cross-entropy method: An application to the max-cut problem
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
- Optimization, approximation, and complexity classes
- Some simplified NP-complete graph problems
- Minimizing breaks by maximizing cuts.
- A discrete dynamic convexized method for the max-cut problem
- An improved rounding method and semidefinite programming relaxation for graph partition
- Solving nonlinearly constrained global optimization problem via an auxiliary function method
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Advanced Scatter Search for the Max-Cut Problem
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- P-Complete Approximation Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Randomized heuristics for the Max-Cut problem
- Gadgets, Approximation, and Linear Programming
- A Spectral Bundle Method for Semidefinite Programming
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Reducibility among Combinatorial Problems
This page was built for publication: Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
