The method of global equilibrium search

DOI10.1007/BF02667916zbMath0946.90070MaRDI QIDQ1968509

V. P. Shilo

Publication date: 25 October 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

simulated annealinginteger linear programmingdiscrete optimization problemsBoltzmann optimization

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial optimization (90C27)

Related Items

Problems of discrete optimization: challenges and main approaches to solve them ⋮ Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel ⋮ Kernel technology to solve discrete optimization problems ⋮ Solving unconstrained binary quadratic programming problem by global equilibrium search ⋮ Solving the maxcut problem by the global equilibrium search ⋮ Results of an experimental investigation of the efficiency of the global-equilibrium-search method ⋮ Solving the quadratic assignment problem by the repeated iterated tabu search method

Cites Work

• Optimization by Simulated Annealing
• A new polynomial-time algorithm for linear programming
• Bounding the probability of success of stochastic methods for global optimization
• Local search with memory: Benchmarking RTS
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item