Global equilibrium search applied to the unconstrained binary quadratic optimization problem
From MaRDI portal
Recommendations
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- The application of binary accelerated particle swarm optimization method to unconstrained binary quadratic problems
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- The unconstrained binary quadratic programming problem: a survey
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A branch and bound algorithm for the maximum clique problem
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- A solvable case of quadratic 0-1 programming
- Adaptive memory tabu search for binary quadratic programs
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques
- An evolutionary heuristic for quadratic 0-1 programming
- Bounding the probability of success of stochastic methods for global optimization
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Construction of test problems in quadratic bivalent programming
- Graph separation techniques for quadratic zero-one programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lower bound improvement and forcing rule for quadratic binary programming
- Maximizing the Product of Two Linear Functions In 0-1 Variables
- Minimization of a quadratic pseudo-Boolean function
- Minimum cuts and related problems
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- Optimization by simulated annealing
- Problems of discrete optimization: challenges and main approaches to solve them
- Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
- Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
- Semidefinite relaxation and nonconvex quadratic optimization
- The maximum clique problem
Cited in
(14)- On the benefits of a new continuous reformulation for QUBO problems
- A column generation approach for the unconstrained binary quadratic programming problem
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- A review of recent advances in global optimization
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Periodic complementary binary sequences and combinatorial optimization algorithms
- The application of binary accelerated particle swarm optimization method to unconstrained binary quadratic problems
- Solving the maxcut problem by the global equilibrium search
- Diversification-driven tabu search for unconstrained binary quadratic problems
- Solving weighted MAX-SAT via global equilibrium search
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- On characterization of maximal independent sets via quadratic optimization
- Iterated tabu search for the unconstrained binary quadratic optimization problem
This page was built for publication: Global equilibrium search applied to the unconstrained binary quadratic optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459821)
