Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016 (2016), Article ID 4360909, 3 pages
http://dx.doi.org/10.1155/2016/4360909
Editorial

Bilevel Programming, Equilibrium, and Combinatorial Problems with Applications to Engineering 2016

1School of Engineering and Sciences (EIC), Tecnológico de Monterrey (ITESM), Campus Monterrey, Av. Eugenio Garza Sada 2501 Sur, 64849 Monterrey, NL, Mexico
2Department of Social Modeling, Central Economics & Mathematics Institute (CEMI), Russian Academy of Sciences, Nakhimovsky Pr. 47, Moscow 117418, Russia
3Department of Computing, Sumy State University, Rimsky-Korsakov St. 2, Sumy 40007, Ukraine
4Department of Mathematics and Informatics, TU Bergakademie Freiberg, Akademiestrasse 6, Freiberg, 09596 Saxony, Germany
5Department of Industrial Engineering, Texas Tech University, P.O. Box 43061, Lubbock, TX 79409, USA
6Facultad de Ciencias Físico-Matemáticas, Universidad Autónoma de Nuevo León, Av. Universidad S/N, 66450 San Nicolás de los Garza, NL, Mexico
7Kharkiv Educational and Scientific Institute of the University of Banking, Av. Peremogy 55, Kharkiv 61174, Ukraine

Received 15 September 2016; Accepted 15 September 2016

Copyright © 2016 Vyacheslav V. Kalashnikov et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Dempe, B. S. Mordukhovich, and A. B. Zemkoho, “Necessary optimality conditions in pessimistic bilevel programming,” Optimization, vol. 63, no. 4, pp. 505–533, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. S. Dempe and J. Dutta, “Is bilevel programming a special case of a mathematical program with complementarity constraints?” Mathematical Programming Series A, vol. 131, no. 1-2, pp. 37–48, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. D. Catanzaro, E. Gourdin, M. Labbé, and F. A. Özsoy, “A branch-and-cut algorithm for the partitioning-hub location-routing problem,” Computers & Operations Research, vol. 38, no. 2, pp. 539–549, 2011. View at Publisher · View at Google Scholar · View at Scopus
  4. G. Heilporn, M. Labbé, P. Marcotte, and G. Savard, “A polyhedral study of the network pricing problem with connected toll arcs,” Networks, vol. 55, no. 3, pp. 234–246, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. S. T. DeNegre and T. K. Ralphs, “A branch-and-cut algorithm for integer bilevel linear programs,” Operations Research/ Computer Science Interfaces Series, vol. 47, pp. 65–78, 2009. View at Publisher · View at Google Scholar · View at Scopus
  6. L. Liberti and C. C. Pantelides, “An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms,” Journal of Global Optimization, vol. 36, no. 2, pp. 161–189, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus