Simulated annealing for the unconstrained quadratic pseudo-Boolean function

DOI10.1016/S0377-2217(97)00130-6zbMath0947.90610OpenAlexW2012535989MaRDI QIDQ1296801

V. Pereyra

Publication date: 8 November 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00130-6

zbMATH Keywords

heuristicssimulated annealing0-1 quadratic programming

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Related Items

Metaheuristic Algorithms, Building an iterative heuristic solver for a quantum annealer, Diversification-driven tabu search for unconstrained binary quadratic problems, A hybrid metaheuristic approach to solving the UBQP problem, A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques, The unconstrained binary quadratic programming problem: a survey, Solving unconstrained binary quadratic programming problem by global equilibrium search, A new approach for modeling and solving set packing problems, Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, A linearization framework for unconstrained quadratic (0-1) problems, One-pass heuristics for large-scale unconstrained binary quadratic problems, An unconstrained quadratic binary programming approach to the vertex coloring problem

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Upper-bounds for quadratic 0-1 maximization
• A solvable case of quadratic 0-1 programming
• Experiments in quadratic 0-1 programming
• A solvable class of quadratic 0-1 programming
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Minimization of a quadratic pseudo-Boolean function
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
• The basic algorithm for pseudo-Boolean programming revisited
• Unconstrained 0-1 optimization and Lagrangean relaxation
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Quadratic knapsack problems
• Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
• Minimum cuts and related problems
• Equation of State Calculations by Fast Computing Machines
• Some Network Flow Problems Solved with Pseudo-Boolean Programming