This paper presents an algorithm for determining an optimum solution to a two-stage production sequencing problem with these characteristics: There are n jobs to be sequenced in a two-stage production ...

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 ...

Many important and valuable planning and scheduling problems in logistics and automation are combinatorial optimization problems. The most famous problem of this type is the traveling salesman problem ...

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 ...