Randomized heuristics for the Max-Cut problem
From MaRDI portal
Recommendations
- A gradient-based randomised heuristic for the maximum cut problem
- Evolutionary Computation in Combinatorial Optimization
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- Advanced scatter search for the max-cut problem
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
Cites work
- scientific article; zbMATH DE number 1372697 (Why is no real title available?)
- A More Portable Fortran Random Number Generator
- A Spectral Bundle Method for Semidefinite Programming
- A graph-theoretic via minimization algorithm for two-layer printed circuit boards
- A hybrid GRASP with perturbations for the Steiner problem in graphs
- A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy
- A probabilistic heuristic for a computationally difficult set covering problem
- A projected gradient algorithm for solving the maxcut SDP relaxation
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Greedy randomized adaptive search procedures
- Handbook of applied optimization
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- Probability distribution of solution time in GRASP: an experimental investigation
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Variable neighborhood search
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
Cited in
(62)- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- Cross-entropy and rare events for maximal cut and partition problems
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
- Solution-based versus attribute-based tabu search for binary integer programming
- Probabilistic GRASP-tabu search algorithms for the UBQP problem
- Local Search Based on Genetic Algorithms
- A discrete filled function algorithm for approximate global solutions of max-cut problems
- An effective iterated tabu search for the maximum bisection problem
- Routing and wavelength assignment by partition colouring
- Impact of graph structures for QAOA on maxcut
- An efficient Lagrangian smoothing heuristic for max-cut
- Scatter search --- wellsprings and challenges
- Variable neighbourhood search: Methods and applications
- Constructing test functions for global optimization using continuous formulations of graph problems
- Multiple phase tabu search for bipartite Boolean quadratic programming with partitioned variables
- Hybridizations of GRASP with path relinking for the far from most string problem
- A new discrete filled function method for solving large scale max-cut problems
- Variable neighbourhood search: methods and applications
- High quality circuit-based 3-SAT mappings for oscillator Ising machines
- A gradient-based randomised heuristic for the maximum cut problem
- Hybrid algorithms for placement of virtual machines across geo-separated data centers
- Solving MaxCut with quantum imaginary time evolution
- A continuous nonlinear optimization perspective on the spin glass problem
- Bistable latch Ising machines
- Solving a bus driver scheduling problem with randomized multistart heuristics
- Black box scatter search for general classes of binary optimization problems
- Two level minimization in multidimensional scaling
- Memetic search for the max-bisection problem
- Evolutionary Computation in Combinatorial Optimization
- Path relinking for unconstrained binary quadratic programming
- Hybridizing the cross-entropy method: An application to the max-cut problem
- Randomized heuristics for the family traveling salesperson problem
- Solving the maxcut problem by the global equilibrium search
- Benchmarking the emulation of measurement-based quantum computing through the max K-Cut algorithm
- A nonmonotone GRASP
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
- Discrete optimization with decision diagrams
- Greedy randomized adaptive search procedures with path relinking. An analytical review of designs and implementations
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution
- A discrete dynamic convexized method for the max-cut problem
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure
- A modified VNS metaheuristic for max-bisection problems
- Solving combinatorial optimisation problems using oscillator based Ising machines
- Lagrangian smoothing heuristics for Max-cut
- A Heuristic Solution of a Cutting Problem Using Hypergraphs
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
- Heuristic and exact methods for the cutting sequencing problem
- On the optimality of the random hyperplane rounding technique for MAX CUT
- Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
- Solution approaches for the vehicle routing problem with occasional drivers and time windows
- From Graph Orientation to the Unweighted Maximum Cut
- A new global algorithm for max-cut problem with chordal sparsity
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
- Estimation of distribution algorithm for the max-cut problem
- Exponential extrapolation memory for tabu search
- A multiple search operator heuristic for the max-k-cut problem
- Designing state-of-the-art metaheuristics: what have we learned from the parallel-machine scheduling problem with setups?
- TTT plots: a perl program to create time-to-target plots
- Restart strategies for GRASP with path-relinking heuristics
- General variable neighborhood search for the capacitated single allocation hub maximal covering problem
This page was built for publication: Randomized heuristics for the Max-Cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4405937)
