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