We study a problem of minimising the total number of zeros in the gaps between blocks of consecutive ones in the columns of a binary matrix by permuting its rows. The problem is referred to as the Consecutive Ones Matrix Augmentation Problem, and is known to be NP-hard. An analysis of the...

This note suggests faster algorithms for two integrated production/distribution problems studied earlier, improving their complexities from O(n2V + 4) and O(n2(L + V)2) to O(n) and O(n + Vmin {V, n}) respectively, where n is the number of products to be delivered, V is the number of vehicles...

The single-item capacitated economic lot-sizing (CELS) problem is a fundamental problem of production and inventory management. The first fully polynomial approximation scheme (FPTAS) for this problem with concave cost functions was developed by Van Hoesel and Wagelmans [C.P.M. Van Hoesel,...