Добірка наукової літератури з теми "Network interdiction problems"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Network interdiction problems".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Network interdiction problems"
Pavlikov, Konstantin. "Improved formulations for minimum connectivity network interdiction problems." Computers & Operations Research 97 (September 2018): 48–57. http://dx.doi.org/10.1016/j.cor.2018.04.012.
Повний текст джерелаBhandari, Phanindra Prasad, and Shree Ram Khadka. "Lexicographically Maximum Flows under an Arc Interdiction." Journal of Nepal Mathematical Society 4, no. 2 (December 17, 2021): 8–14. http://dx.doi.org/10.3126/jnms.v4i2.41459.
Повний текст джерелаLuo, Junren, Xiang Ji, Wei Gao, Wanpeng Zhang, and Shaofei Chen. "Goal Recognition Control under Network Interdiction Using a Privacy Information Metric." Symmetry 11, no. 8 (August 17, 2019): 1059. http://dx.doi.org/10.3390/sym11081059.
Повний текст джерелаLim, Churlzu, and J. Cole Smith. "Algorithms for discrete and continuous multicommodity flow network interdiction problems." IIE Transactions 39, no. 1 (January 2007): 15–26. http://dx.doi.org/10.1080/07408170600729192.
Повний текст джерелаJiang, Shouyong, Yong Wang, Marcus Kaiser, and Natalio Krasnogor. "NIHBA: a network interdiction approach for metabolic engineering design." Bioinformatics 36, no. 11 (March 13, 2020): 3482–92. http://dx.doi.org/10.1093/bioinformatics/btaa163.
Повний текст джерелаMalaviya, Ajay, Chase Rainwater, and Thomas Sharkey. "Multi-period network interdiction problems with applications to city-level drug enforcement." IIE Transactions 44, no. 5 (May 2012): 368–80. http://dx.doi.org/10.1080/0740817x.2011.602659.
Повний текст джерелаYates, Justin, Xinghua Wang, and Nannan Chen. "Assessing the effectiveness of k-shortest path sets in problems of network interdiction." Optimization and Engineering 15, no. 3 (May 31, 2013): 721–49. http://dx.doi.org/10.1007/s11081-013-9220-z.
Повний текст джерелаZhang, Youzhi, Qingyu Guo, Bo An, Long Tran-Thanh, and Nicholas R. Jennings. "Optimal Interdiction of Urban Criminals with the Aid of Real-Time Information." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 1262–69. http://dx.doi.org/10.1609/aaai.v33i01.33011262.
Повний текст джерелаZhang, Kaike, Xueping Li, and Mingzhou Jin. "Efficient Solution Methods for a General r-Interdiction Median Problem with Fortification." INFORMS Journal on Computing 34, no. 2 (March 2022): 1272–90. http://dx.doi.org/10.1287/ijoc.2021.1111.
Повний текст джерелаYates, Justin, and Sujeevraja Sanjeevi. "A length-based, multiple-resource formulation for shortest path network interdiction problems in the transportation sector." International Journal of Critical Infrastructure Protection 6, no. 2 (June 2013): 107–19. http://dx.doi.org/10.1016/j.ijcip.2013.04.002.
Повний текст джерелаДисертації з теми "Network interdiction problems"
Boyle, Michael R. "Partial-enumeration for planar network interdiction problems." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1998. http://handle.dtic.mil/100.2/ADA343529.
Повний текст джерелаCormican, Kelly James. "Computational methods for deterministic and stochastic network interdiction problems." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1995. http://handle.dtic.mil/100.2/ADA297596.
Повний текст джерелаLunday, Brian Joseph. "Resource Allocation on Networks: Nested Event Tree Optimization, Network Interdiction, and Game Theoretic Methods." Diss., Virginia Tech, 2010. http://hdl.handle.net/10919/77323.
Повний текст джерелаPh. D.
Altner, Douglas S. "Advancements on problems involving maximum flows." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24828.
Повний текст джерелаCommittee Chair: Ozlem Ergun; Committee Member: Dana Randall; Committee Member: Joel Sokol; Committee Member: Shabbir Ahmed; Committee Member: William Cook.
Akgun, Ibrahim. "The K-group maximum-flow network-interdiction problem." Thesis, Monterey, California. Naval Postgraduate School, 2000. http://hdl.handle.net/10945/32947.
Повний текст джерелаBingol, Levent. "A Lagrangian Heuristic for solving a network interdiction problem." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2001. http://handle.dtic.mil/100.2/ADA401595.
Повний текст джерелаThesis Advisor(s): Wood, R. Kevin. "December 2001." Includes bibliographical references (p. 35-36). Also Available online.
Salazar, zendeja Luis. "Modèles et algorithmes pour le problème d'interdiction de l'arbre couvrant de poids minimal." Electronic Thesis or Diss., Centrale Lille Institut, 2022. http://www.theses.fr/2022CLIL0028.
Повний текст джерелаIn this thesis, we study the Minimum Spanning Tree Interdiction (MSTI) problem. This problem is a two-player game between a network operator and an interdictor. The former aims to determine a Minimum Spanning Tree (MST) in a network. Constrained by a budget, the latter seeks to change the network topology to increase the weight of aMST. Two types of interdiction are considered: total and partial interdiction. A total interdicted edge is considered absent while the weight of a partial interdicted edge is augmented by a predefined amount. The interdictor’s budget ismodeled as a cardinality, each edge has the same interdiction weight, or knapsack constraint, the interdiction weightsmight be different. Seven mathematical formulations for the MSTI problem are devised. They proved to be efficient on small and medium-size graphs. A Branch-and-Price algorithm and a Benders Decomposition algorithm are designedfor larger graphs. In addition, valid inequalities are proposed to strengthen the models and improve the efficiency of the proposed methods. Instances including up to 200 nodes and 19900 edges are solved to optimality
Cabalka, Matouš. "Pokročilá optimalizace toků v sítích." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2018. http://www.nusl.cz/ntk/nusl-392835.
Повний текст джерелаMichalopoulos, Dennis Paul 1979. "Prioritization and optimization in stochastic network interdiction problems." 2008. http://hdl.handle.net/2152/18188.
Повний текст джерелаtext
Nehme, Michael Victor. "Two-person games for stochastic network interdiction : models, methods, and complexities." 2009. http://hdl.handle.net/2152/7512.
Повний текст джерелаtext
Частини книг з теми "Network interdiction problems"
Smith, J. Cole, Mike Prince, and Joseph Geunes. "Modern Network Interdiction Problems and Algorithms." In Handbook of Combinatorial Optimization, 1949–87. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-7997-1_61.
Повний текст джерелаTorres, Marina, Shouyong Jiang, David Pelta, Marcus Kaiser, and Natalio Krasnogor. "Strain Design as Multiobjective Network Interdiction Problem: A Preliminary Approach." In Advances in Artificial Intelligence, 273–82. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00374-6_26.
Повний текст джерелаSchäfer, Luca E., Tobias Dietz, Marco V. Natale, Stefan Ruzika, Sven O. Krumke, and Carlos M. Fonseca. "The Bicriterion Maximum Flow Network Interdiction Problem in s-t-Planar Graphs." In Operations Research Proceedings, 133–39. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-48439-2_16.
Повний текст джерелаKhanduzi, Raheleh, and Abdolmotalleb Rastegar. "Designing a cooperative hierarchical model of interdiction median problem with protection and its solution approach: A case study of health-care network." In Intelligent IoT Systems in Personalized Health Care, 53–88. Elsevier, 2021. http://dx.doi.org/10.1016/b978-0-12-821187-8.00003-4.
Повний текст джерелаТези доповідей конференцій з теми "Network interdiction problems"
Zhang, Youzhi, Bo An, Long Tran-Thanh, Zhen Wang, Jiarui Gan, and Nicholas R. Jennings. "Optimal Escape Interdiction on Transportation Networks." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/550.
Повний текст джерелаMatta, Krish, Xiaoyuan Liu, and Ilya Safro. "Decomposition Based Refinement for the Network Interdiction Problem." In 2023 IEEE High Performance Extreme Computing Conference (HPEC). IEEE, 2023. http://dx.doi.org/10.1109/hpec58863.2023.10363524.
Повний текст джерелаGuo, Qingyu, Bo An, and Long Tran-Thanh. "Playing Repeated Network Interdiction Games with Semi-Bandit Feedback." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/515.
Повний текст джерелаJanjarassuk, U., and T. Nakrachata-Amon. "A simulated annealing algorithm to the stochastic network interdiction problem." In 2015 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2015. http://dx.doi.org/10.1109/ieem.2015.7385642.
Повний текст джерелаXu, Kai, Kaiming Xiao, Quanjun Yin, Yabing Zha, and Cheng Zhu. "Bridging the Gap between Observation and Decision Making: Goal Recognition and Flexible Resource Allocation in Dynamic Network Interdiction." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/625.
Повний текст джерелаKuhnle, Alan, Victoria G. Crawford, and My T. Thai. "Scalable and Adaptive Algorithms for the Triangle Interdiction Problem on Billion-Scale Networks." In 2017 IEEE International Conference on Data Mining (ICDM). IEEE, 2017. http://dx.doi.org/10.1109/icdm.2017.33.
Повний текст джерелаЗвіти організацій з теми "Network interdiction problems"
Chauhan, Darshan Rajesh. Robust Maximum Flow Network Interdiction Problem. Portland State University Library, January 2020. http://dx.doi.org/10.15760/etd.7315.
Повний текст джерела