Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
From MaRDI portal
Publication:489116
DOI10.1007/S40305-014-0045-ZzbMATH Open1307.90190OpenAlexW2014299902MaRDI QIDQ489116FDOQ489116
Authors: Geng Lin, Wenxing Zhu 
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
Recommendations
- A discrete dynamic convexized method for the max-cut problem
- An adaptive multistart tabu search approach to solve the maximum clique problem
- Multistart search for the cyclic cutwidth minimization problem
- scientific article; zbMATH DE number 5232308
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- Adaptive, restart, randomized greedy heuristics for maximum clique
- Near-optimal approximation algorithm for simultaneous Max-Cut
- The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case
- A new discrete filled function method for solving large scale max-cut problems
Cites Work
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- A Spectral Bundle Method for Semidefinite Programming
- Reducibility among combinatorial problems
- Optimization, approximation, and complexity classes
- Gadgets, Approximation, and Linear Programming
- Some simplified NP-complete graph problems
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems
- P-Complete Approximation Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- A discrete dynamic convexized method for the max-cut problem
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- A dynamic convexized method for nonconvex mixed integer nonlinear programming
- A discrete dynamic convexized method for nonlinear integer programming
- Hybridizing the cross-entropy method: An application to the max-cut problem
- A hybrid metaheuristic approach to solving the UBQP problem
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- A semidefinite programming based polyhedral cut and price approach for the maxcut problem
- Advanced scatter search for the max-cut problem
- Memetic search for the max-bisection problem
- Randomized heuristics for the Max-Cut problem
- Solving the maxcut problem by the global equilibrium search
- An improved rounding method and semidefinite programming relaxation for graph partition
- A discrete filled function algorithm for approximate global solutions of max-cut problems
- Minimizing breaks by maximizing cuts.
- A new discrete filled function method for solving large scale max-cut problems
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
- Solving nonlinearly constrained global optimization problem via an auxiliary function method
- Title not available (Why is that?)
- Conjugate conflict continuation graphs for multi-layer constrained via minimization
Cited In (7)
- A new discrete filled function method for solving large scale max-cut problems
- A gradient-based randomised heuristic for the maximum cut problem
- Randomized heuristics for the Max-Cut problem
- Evolutionary Computation in Combinatorial Optimization
- A discrete dynamic convexized method for the max-cut problem
- Estimation of distribution algorithm for the max-cut problem
- A multiple search operator heuristic for the max-k-cut problem
Uses Software
This page was built for publication: Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489116)
