The Central European Journal of Operations Research is the official journal of the ?sterreichische Gesellschaft für Operations Research. The journal offers high quality papers that cover the theory and practice of operations research and the relationship of operations research methods to modern quantitative economics and business administration. Each issue expands our understanding of managerial problems in complex systems and supports the decision-making process. Among the key topics covered are finance and banking; productivity and efficiency in the public sector; environmental and energy issues; computational tools for strategic decision support; production management and logistics; and planning and scheduling. This journal features theoretical papers as well as application-oriented contributions and practical case studies. Occasionally, special issues feature a particular area of investigation or a detailed report on the results of scientific meetings.Officially cited as: Cent Eur J Oper Res

We present a Branch and Cut algorithm of the software package LaGO to solve nonconvex mixed-integer nonlinear programs (MINLPs). A linear outer approximation is constructed from a convex relaxation of the problem. Since we do not require an algebraic representation of the problem, reformulation techniques for the construction of the convex relaxation cannot be applied, and we are restricted to sampling techniques in case of nonquadratic nonconvex functions. The linear relaxation is further improved by mixed-integer-rounding cuts. Also box reduction techniques are applied to improve efficiency. Numerical results on medium size test problems are presented to show the efficiency of the method.