Abstract: This paper presents a method to certify the computational complexity of a standard Branch and Bound method for solving Mixed-Integer Quadratic Programming (MIQP) problems defined as ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback