In this paper, we consider decentralized two-level zero-one programming problems in which there are one decision maker (the leader) at the upper level and two or more decision makers (the followers) at the lower level,and decision variables of each decision maker are zero-one variables. We assume that the followers respond by choosing a Nash equilibrium for a given decision of the leader. On the assumption, the leader makes a decision so as to minimize his/her objective function. We call such a decision of the leader and the reaction of the followers a Stackelberg-Nash solution. Based on the genetic algorithms, computational methods for obtaining Stackelberg-Nash solutions to the decentralized two-level zero-one programming problem are developed.To demonstrate feasibility and effectiveness of the methods, computational experiments are carried out.
