One of the most computationally useful ideas of the 1970s is the observation that many hard integer programming problems can be viewed as easy problems complicated by a relatively small set of side constraints. Dualizing the side constraints produces a Lagrangian problem that is easy to solve...

A new approximate algorithm for multidimensional zero-one knapsack problems with all positive coefficients is presented. The procedure is controlled by three parameters which affect the tradeoff between solution quality and computation time and whose values are set by the users. For 48 test...

Given n items, each having a weight w_i, and a container of capacity W, the Subset-Sum Problem (SSP) is to select a subset of the items whose total weight is closest to, without exceeding, W. The paper presents a mixed approach (depth first search-dynamic programming) to the exact solution of the...

This paper addresses the time management problem confronted by sales representatives. The sales representative planning his itinerary must decide the best way to ration time among the accounts comprising his territory. The time management problem is formulated as an integer program whereby each...

Testing and comparison of integer programming algorithms is an integral part of the algorithm development process. When test problems are randomly generated, the techniques of statistical experimental design can provide a basis around which to structure computational experiments. This paper...

Decomposable systems, decomposition and 0-1 integer programming techniques are reviewed relative to project selection problems. It is concluded that a heuristic procedure is a suitable way to handle such problems in organizational settings. A hierarchical multiperiod multidimensional model is...