ABSTRACT
This chapter discusses mathematical programming models - where some or all of the decision variables are required to equal zero or one at optimality. If in a mixed zero-one programming problem the non zero-one variables are required to be integer valued at optimality, the problem comprises a mixed integer zero-one programming problem. Total cover problem represents a special case of the partial cover problem. A number of solution methods have been devised for zero-one programming problems which make use of the foregoing characteristics and, in particular, of the fact that there are a limited number of possible solutions. A zero-one programming problem which has attracted considerable attention is the travelling salesman problem which for n nodes e.g. cities involves determining the shortest complete circuit route among the nodes such that each node is visited once. A number of nodes are to be partitioned into subgroups, each with its associated travelling salesman circuit.
