A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
Sign Up to like & getrecommendations! Published in 2018 at "Optimization Letters"
DOI: 10.1007/s11590-017-1125-x
Abstract: In this paper, we develop a Lagrangian decomposition based heuristic method for general quadratic binary programs (QBPs) with linear constraints. We extend the idea of Lagrangian decomposition by Chardaire and Sutter (Manag Sci 41(4):704–712, 1995)… read more here.
Keywords: quadratic binary; binary programs; approach computing; lagrangian decomposition ... See more keywords