Abstract
We address a particular class of bilevel linear programming problems in which all the variables are discrete. The main computational complexities are analyzed and two enhanced exact algorithms are proposed. The rationale behind these two algorithms is described and a modified version is presented for both. A common test bed is used to assess their computational efficiency along with a comparison with an existing benchmark algorithm.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
