Dual mean field search for large scale linear and quadratic knapsack problems

DOI10.1016/j.physa.2017.02.052zbMath1400.90254OpenAlexW2594288089MaRDI QIDQ1620646

Arturo Berrones, Juan Banda, Jonás Velasco

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2017.02.052

zbMATH Keywords

combinatorial optimizationmean field annealingphysics-inspired heuristics

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

Dual mean field annealing scheme for binary optimization under linear constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Finding compromise solutions in project portfolio selection with multiple experts by inverse optimization
• An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
• An integer programming approach to optimal control problems in context-sensitive probabilistic Boolean networks
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• An effective branch-and-bound algorithm for convex quadratic integer programming
• Mixed integer nonlinear programming tools: a practical overview
• The quadratic knapsack problem -- a survey
• An iterated ``hyperplane exploration approach for the quadratic knapsack problem
• Solving knapsack problems on GPU
• Where are the hard knapsack problems?
• Future paths for integer programming and links to artificial intelligence
• An integer optimization approach for reverse engineering of gene regulatory networks
• Refining the phase transition in combinatorial search
• Logic, Optimization, and Constraint Programming
• Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
• Information Theory and Statistical Mechanics
• Nonlinear Integer Programming
• DEUM - Distribution Estimation Using Markov Networks
• Equation of State Calculations by Fast Computing Machines
• Mixed-integer nonlinear optimization
• Phase Transitions in Combinatorial Optimization Problems
• Heuristics from Nature for Hard Combinatorial Optimization Problems
• Introduction to evolutionary computing
• 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 search for large scale linear and quadratic knapsack problems