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

In this paper, we propose a reference direction approach and an interactive algorithm to solve the general multiple objective integer linear programming problem. At each iteration, only one mixed ...

This week we take a look at a notoriously tricky math puzzle, one originally penned by English mathematician John Conway back in the 1960s. Apparently he was riding the bus home one evening when he ...