Polynomial unconstrained binary optimisation -- part 2
From MaRDI portal
Publication:2256912
DOI10.1504/IJMHEUR.2011.044356zbMath1306.90095MaRDI QIDQ2256912
Gary A. Kochenberger, Jin-Kao Hao, Fred Glover
Publication date: 23 February 2015
Published in: International Journal of Metaheuristics (Search for Journal in Brave)
metaheuristicscomputational efficiencyzero-one optimisationquadratic optimisationunconstrained polynomial optimisationpolynomial unconstrained binary optimisation
Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items (2)
Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation ⋮ Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
This page was built for publication: Polynomial unconstrained binary optimisation -- part 2