New Branch-and-Bound Rules for Linear Bilevel Programming

This publication has 29 references indexed in Scilit:

• Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming
  Annals of Operations Research, 1992
• A Branch and Bound Algorithm for the Bilevel Programming Problem
  SIAM Journal on Scientific and Statistical Computing, 1990
• Convex two-level optimization
  Mathematical Programming, 1988
• A solution method for the static constrained Stackelberg problem via penalty method
  IEEE Transactions on Automatic Control, 1984
• Two-Level Linear Programming
  Management Science, 1984
• An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem
  Operations Research, 1983
• An Algorithm for Solving the General Bilevel Programming Problem
  Mathematics of Operations Research, 1983
• On two-level optimization
  IEEE Transactions on Automatic Control, 1982
• An explicit solution to the multi-level programming problem
  Computers & Operations Research, 1982
• Hierarchical Decentralized Systems and Its New Solution by a Barrier Method
  IEEE Transactions on Systems, Man, and Cybernetics, 1981