Polynomial unconstrained binary optimisation -- part 1

DOI10.1504/IJMHEUR.2011.041196zbMath1306.90094MaRDI QIDQ2256908

Fred Glover, Gary A. Kochenberger, Jin-Kao Hao

Publication date: 23 February 2015

Published in: International Journal of Metaheuristics (Search for Journal in Brave)

zbMATH Keywords

metaheuristicscomputational efficiencysparse problemszero-one optimisationquadratic optimisationbinary unconstrained optimisationunconstrained polynomial optimisation

Mathematics Subject Classification ID

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

Related Items (3)

\(\mathrm{PUBO}_i\): a tunable benchmark with variable importance ⋮ Fast 1-flip neighborhood evaluations for large-scale pseudo-Boolean optimization using posiform representation ⋮ Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing

This page was built for publication: Polynomial unconstrained binary optimisation -- part 1