Simulated annealing for the unconstrained quadratic pseudo-Boolean function

This publication has 18 references indexed in Scilit:

• Minimization of a quadratic pseudo-Boolean function
  European Journal of Operational Research, 1994
• A solvable class of quadratic 0–1 programming
  Discrete Applied Mathematics, 1992
• Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
  SIAM Journal on Discrete Mathematics, 1992
• Unconstrained 0–1 optimization and Lagrangean relaxation
  Discrete Applied Mathematics, 1990
• Upper-bounds for quadratic 0–1 maximization
  Operations Research Letters, 1990
• Experiments in quadratic 0–1 programming
  Mathematical Programming, 1989
• A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem
  Journal of Statistical Physics, 1988
• A solvable case of quadratic 0–1 programming
  Discrete Applied Mathematics, 1986
• A linear-time algorithm for testing the truth of certain quantified boolean formulas
  Information Processing Letters, 1979
• Some Network Flow Problems Solved with Pseudo-Boolean Programming
  Operations Research, 1965