Funder
French ADEME agency
Fondation Mathématique Jacques Hadamard
European Union
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference31 articles.
1. New branch-and-cut algorithm for bilevel linear programming;Audet;J. Optim. Theory Appl.,2007
2. J. Bezanson, A. Edelman, S. Karpinski, V.B. Shah, Julia: A Fresh Approach to Numerical Computing. Technical Report 1411.1607, arXiv, 2014.
3. The PMU placement problem;Brueni;SIAM J. Discrete Math.,2005
4. A study on the computational complexity of the bilevel knapsack problem;Caprara;SIAM J. Optim.,2014
5. Bilevel knapsack with interdiction constraints;Caprara;INFORMS J. Comput.,2016
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献