The following pages link to CirCut (Q16945):
Displaying 41 items.
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813) (← links)
- Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
- Memetic search for the max-bisection problem (Q339560) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- A new discrete filled function method for solving large scale max-cut problems (Q438797) (← links)
- Solving the maxcut problem by the global equilibrium search (Q466339) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- An efficient Lagrangian smoothing heuristic for max-cut (Q549567) (← links)
- Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs (Q724411) (← links)
- Hyperchaotic beats and their collapse to the quasiperiodic oscillations (Q841729) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Solving maximum-entropy sampling problems using factored masks (Q868455) (← links)
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel (Q895077) (← links)
- A discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569) (← links)
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
- Hybridizing the cross-entropy method: An application to the max-cut problem (Q954050) (← links)
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (Q1014949) (← links)
- A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
- Maximum stable set formulations and heuristics based on continuous optimization (Q1396818) (← links)
- Applications of convex optimization in signal processing and digital communication (Q1403287) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
- Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
- On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
- Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
- A continuation approach for solving binary quadratic program based on a class of NCP-functions (Q2344687) (← links)
- Relaxation and decomposition methods for mixed integer nonlinear programming. (Q2386510) (← links)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
- Lagrangian smoothing heuristics for Max-cut (Q2491324) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- A continuation algorithm for max-cut problem (Q2644353) (← links)
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
- Nonconvex Phase Synchronization (Q2832892) (← links)
- Probabilistic Analysis of Semidefinite Relaxation for Binary Quadratic Minimization (Q3058514) (← links)
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence (Q3491323) (← links)
- A Large Neighborhood Search Heuristic for Graph Coloring (Q3612429) (← links)
- Randomized heuristics for the Max-Cut problem (Q4405937) (← links)
- (Q5440597) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- (Q5717954) (← links)
