Dual mean field annealing scheme for binary optimization under linear constraints

DOI10.1016/j.orl.2020.03.002OpenAlexW3013040980MaRDI QIDQ2183203

Jonás Velasco, Juan Banda, Arturo Berrones-Santos

Publication date: 26 May 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2020.03.002

zbMATH Keywords

combinatorial optimizationmean field annealingphysics-inspired heuristics

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
• The quadratic knapsack problem -- a survey
• A genetic algorithm for the multidimensional knapsack problem
• Dual mean field search for large scale linear and quadratic knapsack problems
• An iterated ``hyperplane exploration approach for the quadratic knapsack problem
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
• Refining the phase transition in combinatorial search
• Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
• Information Theory and Statistical Mechanics
• Quadratic knapsack problems
• Equation of State Calculations by Fast Computing Machines
• An efficient mean field approach to the set covering problem
• Statistical mechanics methods and phase transitions in optimization problems

This page was built for publication: Dual mean field annealing scheme for binary optimization under linear constraints