This paper presents the results of experimentation on the development of an efficient branch-and-bound algorithm for the solution of zero-one linear mixed integer programming problems. An implicit ...
In this paper, we propose a new branch and bound algorithm for the solution of large scale separable concave programming problems. The largest distance bisection (LDB) technique is proposed to divide ...
On the 8th of December 2021, M.Sc. Kari Rantanen will defend his doctoral thesis on Optimization Algorithms for Learning Graphical Model Structures. The thesis a part of research done in the ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback