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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback