Recommendations
- Results of an experimental investigation of the efficiency of the global-equilibrium-search method
- État de l'art des méthodes “d'optimisation globale”
- Solving the maxcut problem by the global equilibrium search
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- A Global Search Method for Discrete Stochastic Optimization
Cites work
- A new polynomial-time algorithm for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Bounding the probability of success of stochastic methods for global optimization
- scientific article; zbMATH DE number 3724210 (Why is no real title available?)
- scientific article; zbMATH DE number 41891 (Why is no real title available?)
- scientific article; zbMATH DE number 3802822 (Why is no real title available?)
- Local search with memory: Benchmarking RTS
- Optimization by simulated annealing
- The method of least squares. Geometric properties, alternative approaches, applications.
Cited in
(7)- Kernel technology to solve discrete optimization problems
- Results of an experimental investigation of the efficiency of the global-equilibrium-search method
- Problems of discrete optimization: challenges and main approaches to solve them
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- Solving the maxcut problem by the global equilibrium search
- Solving the quadratic assignment problem by the repeated iterated tabu search method
- Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel
This page was built for publication: The method of global equilibrium search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1968509)
