Abstract
This study reports on new computational results relating to a dynamic programming approach that optimally selects among a given set of products and allocates integer shelf-space units to the products in supermarkets. The computational results are reported for large problems that have been solved on an IBM-PC AT microcomputer.