Mathematical programming discriminant analysis models must be normalised to prevent the generation of discriminant functions in which the variable coefficients and the constant term are zero. This ...

It is shown that the integer linear programming problem with a fixed number of variables is polynomially solvable. The proof depends on methods from geometry of numbers. Journal Information ...

Probabilistic programming languages (PPLs) have emerged as a transformative tool for expressing complex statistical models and automating inference procedures. By integrating probability theory into ...