Simulated annealing for the unconstrained quadratic pseudo-Boolean function

DOI10.1016/S0377-2217(97)00130-6MaRDI QIDQ1296801zbMATH OpenOpenAlexFDO

Authors 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

simulated annealingheuristics0-1 quadratic programming

Mathematics Subject Classification ID

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

Recommendations

• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
• Simulated annealing: A tool for operational research
• scientific article; zbMATH DE number 4085427
• A parallel simulated annealing algorithm
• An improved annealing scheme for the QAP

Cites work

• scientific article; zbMATH DE number 3643044 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem.
• A solvable case of quadratic 0-1 programming
• A solvable class of quadratic 0-1 programming
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Equation of state calculations by fast computing machines
• Experiments in quadratic 0-1 programming
• Minimization of a quadratic pseudo-Boolean function
• Minimum cuts and related problems
• Optimization by simulated annealing
• Quadratic knapsack problems
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• Some Network Flow Problems Solved with Pseudo-Boolean Programming
• The basic algorithm for pseudo-Boolean programming revisited
• Unconstrained 0-1 optimization and Lagrangean relaxation
• Upper-bounds for quadratic 0-1 maximization

Cited in

(15)

• Solving unconstrained binary quadratic programming problem by global equilibrium search
• An unconstrained quadratic binary programming approach to the vertex coloring problem
• A linearization framework for unconstrained quadratic (0-1) problems
• The unconstrained binary quadratic programming problem: a survey
• Simulated annealing on uncorrelated energy landscapes
• One-pass heuristics for large-scale unconstrained binary quadratic problems
• Metaheuristic algorithms
• A hybrid metaheuristic approach to solving the UBQP problem
• Diversification-driven tabu search for unconstrained binary quadratic problems
• Design of Highly Nonlinear Balanced Boolean Functions Using an Hybridation of DCA and Simulated Annealing Algorithm
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
• Building an iterative heuristic solver for a quantum annealer
• A new approach for modeling and solving set packing problems
• A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques
• Quaternion simulated annealing

This page was built for publication: Simulated annealing for the unconstrained quadratic pseudo-Boolean function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296801)