CirCut

swMATH4782MaRDI QIDQ16945FDOQ16945

Author name not available (Why is that?)

Described by source

• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs

Cited In (41)

• Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
• An improved linearization strategy for zero-one quadratic programming problems
• Hyperchaotic beats and their collapse to the quasiperiodic oscillations
• Probabilistic GRASP-tabu search algorithms for the UBQP problem
• A discrete filled function algorithm for approximate global solutions of max-cut problems
• An effective iterated tabu search for the maximum bisection problem
• An efficient Lagrangian smoothing heuristic for max-cut
• An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
• Constructing test functions for global optimization using continuous formulations of graph problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new discrete filled function method for solving large scale max-cut problems
• Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
• A global continuation algorithm for solving binary quadratic programming problems
• Solving maximum-entropy sampling problems using factored masks
• Randomized heuristics for the Max-Cut problem
• On computational capabilities of Ising machines based on nonlinear oscillators
• Nonconvex phase synchronization
• A continuation algorithm for max-cut problem
• Path relinking for unconstrained binary quadratic programming
• Memetic search for the max-bisection problem
• Hybridizing the cross-entropy method: An application to the max-cut problem
• Solving the maxcut problem by the global equilibrium search
• A nonmonotone GRASP
• A continuation approach for solving binary quadratic program based on a class of NCP-functions
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Lagrangian smoothing heuristics for Max-cut
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
• A Large Neighborhood Search Heuristic for Graph Coloring
• Relaxation and decomposition methods for mixed integer nonlinear programming.
• An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
• Global optimality conditions and optimization methods for quadratic integer programming problems
• Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization
• Applications of convex optimization in signal processing and digital communication
• Maximum stable set formulations and heuristics based on continuous optimization
• A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
• Linear and quadratic programming approaches for the general graph partitioning problem
• A multiple search operator heuristic for the max-k-cut problem

This page was built for software: CirCut