A PROCEDURE FOR SOLVING INTEGER BILEVEL LINEAR PROGRAMMING PROBLEMS
This paper is an extension of the K th-best approach  for solving bilevel linear programming problems with integer variables. NAZ cut  and A-T cut  are added to reach the integer optimum. An example is given to show the efficiency of the proposed algorithm.
A.Y. Adhami, and Quazzafi Rabbani