Journal
OPTIMIZATION LETTERS
Volume 9, Issue 7, Pages 1447-1468Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-015-0872-9
Keywords
Bilevel linear programming; Discrete bilevel linear problems; Exact methods; Cutting planes; Branch and cut
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available