A branch-and-cut algorithm for integer bilevel linear programs

Operations Research/ Computer Science Interfaces Series

Volumn 47, Issue , 2009, Pages 65-78

  DeNegre, S T ^a   Ralphs, T K ^a  

^a Lehigh University   (United States)

Author keywords

Bilevel programming; Branch and bound; Branch and cut; Integer programming; Valid inequality

Indexed keywords

EID: 84888585126     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-88843-9_4     Document Type: Article

References (25)

1. Achterberg T, Koch T, Martin A (2005) Branching rules revisited. Operations Research Letters 33(1):42-54
2. Bard J (1988) Convex two-level optimization. Mathematical Programming 40: 15-27
3. Bard J, Moore J (1990) A branch and bound algorithm for the bilevel programming problem. SIAM Journal on Scientific and Statistical Computing 11(2):281-292
4. Bard J, Moore J (1992) An algorithm for the discrete bilevel programming problem. Naval Research Logistics 39:419-435
5. Cormican K, Morton D, Wood R (1998) Stochastic network interdiction. Operations Research 46(2):184-197
6. Cornuejols G (2008) Valid inequalities for mixed integer linear programs. Mathematical Programming B 112:3-44
7. Dempe S (2001) Discrete bilevel optimization problems. Tech. Rep. D-04109, Institut fur Wirtschaftsinformatik, Universitat Leipzig, Leipzig, Germany
8. DeNegre S, Ralphs T, Guzelsoy M (2008) A new class of valid inequalities for mixed integer bilevel linear programs. Tech. rep., Lehigh University
9. Figueira J (2000) MCDM Numerical Instances Library. URL http://www.univvalenciennes. fr/ROAD/MCDM/ListMOKP.html
10. Ghare P, Montgomery D, Turner W (1971) Optimal interdiction policy for a flow network. Naval Research Logistics Quarterly 18:27-45
11. Hansen P, Jaumard B, Savard G (1992) New branch-and-bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing 13(5):1194-1217
12. Held H, Woodruff D (2005) Heuristics for multi-stage interdiction of stochastic networks. Journal of Heuristics 11(5-6):483-500
13. Israeli E, Wood R (2002) Shortest path network interdiction. Networks 40(2): 97-111
14. Janjarassuk U, Linderoth J (2006) Reformulation and sampling to solve a stochastic network interdiction problem. Tech. Rep. 06T-001, Lehigh University
15. Lim C, Smith J (2007) Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Transactions 39(1):15-26
16. Loridan P, Morgan J (1996) Weak via strong stackelberg problem: New results. Journal of Global Optimization 8(3):263-287
17. Lougee-Heimer R (2003) The Common OPtimization INterface for Operations Research. IBM Journal of Research and Development 47(1):57-66
18. McMasters A, Mustin T (1970) Optimal interdiction of a supply network. Naval Research Logistics Quarterly 17:261-268
19. Moore J, Bard J (1990) The mixed integer linear bilevel programming problem. Operations Research 38(5):911-921
20. Morton D, Pan F, Saeger K (2007) Models for nuclear smuggling interdiction. IIE Transactions 39(1):3-14
21. Royset J, Wood R (2007) Solving the bi-objective maximum-flow networkinterdiction problem. INFORMS Journal on Computing 19(2):175-184
22. Vicente L, Savard G, Judice J (1994) Descent approaches for quadratic bilevel programming. Journal of Optimization Theory and Applications 81:379-399
23. Wen U, Yang Y (1990) Algorithms for solving the mixed integer two-level linear programming problem. Computers & Operations Research 17(2):133-142
24. Wollmer R (1964) Removing arcs from a network. Operations Research 12(6): 934-940
25. Wood R (1993) Deterministic network interdiction. Mathematical and Computer Modelling 17(2):1-18