This is a preview. Log in through your library . Abstract This paper proposes a dynamic programming algorithm for decision CPM (DCPM) networks. DCPM is a natural ...
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 ...