Introduction

Abstract

This discrete analogue of linear programming (LP) is a fundamental NP-hard problem with numerous important applications. However, solving Pd remains in general a formidable computational challenge, sometimes even for some small size problems. For standard references on the theory and practice of integer programming the interested reader is referred to, e.g., Nemhauser and Wolsey [113], Schrijver [121], Wolsey [136], and Bertsimas and Weismantel [21].