Abstract
This paper presents a continuous method for solving binary quadratic programming problems. First, the original problem is converted into an equivalent continuous optimization problem by using NCP (Nonlinear Complementarity Problem) function, which can be further carry on the smoothing processing by aggregate function. Therefore, the original combinatorial optimization problem could be transformed into a general differential nonlinear programming problem, which can be solved by mature optimization technique. Through some numerical experiments, the applicability, robustness, and solution quality of the approach are proved, which could be applied to large scale problems.
Highlights
This paper presents a continuous method for solving binary quadratic programming problems
The original problem is converted into an equivalent continuous optimization problem by using NCP (Nonlinear Complementarity Problem) function, which can be further carry on the smoothing processing by aggregate function
The original combinatorial optimization problem could be transformed into a general differential nonlinear programming problem, which can be solved by mature optimization technique
Summary
College of Science, University of Shanghai for Science and Technology, Shanghai, China. How to cite this paper: Liu, Z., Yu, Z.S. and Wang, Y.L. (2018) A Continuous Approach to Binary Quadratic Problems. Journal of Applied Mathematics and Physics, 6, 1720-1732.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have