Einloggen

Thematische Bibliographien / Network interdiction problems

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Network interdiction problems“

Autor: Grafiati

Veröffentlicht am 18. Mai 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Network interdiction problems" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Network interdiction problems"

1

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Bhandari, Phanindra Prasad, and Shree Ram Khadka. "Lexicographically Maximum Flows under an Arc Interdiction." Journal of Nepal Mathematical Society 4, no. 2 (2021): 8–14. http://dx.doi.org/10.3126/jnms.v4i2.41459.

Der volle Inhalt der Quelle

Annotation:

Network interdiction problem arises when an unwanted agent attacks the network system to deteriorate its transshipment efficiency. Literature is flourished with models and solution approaches for the problem. This paper considers a single commodity lexicographic maximum flow problem on a directed network with capacitated vertices to study two network flow problems under an arc interdiction. In the first, the objective is to find an arc on input network to be destroyed so that the residual lexicographically maximum flow is lexicographically minimum. The second problem aims to find a flow patter

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

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 (2019): 1059. http://dx.doi.org/10.3390/sym11081059.

Der volle Inhalt der Quelle

Annotation:

Goal recognition (GR) is a method of inferring the goals of other agents, which enables humans or AI agents to proactively make response plans. Goal recognition design (GRD) has been proposed to deliberately redesign the underlying environment to accelerate goal recognition. Along with the GR and GRD problems, in this paper, we start by introducing the goal recognition control (GRC) problem under network interdiction, which focuses on controlling the goal recognition process. When the observer attempts to facilitate the explainability of the actor’s behavior and accelerate goal recognition by

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Lim, Churlzu, and J. Cole Smith. "Algorithms for discrete and continuous multicommodity flow network interdiction problems." IIE Transactions 39, no. 1 (2007): 15–26. http://dx.doi.org/10.1080/07408170600729192.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Jiang, Shouyong, Yong Wang, Marcus Kaiser, and Natalio Krasnogor. "NIHBA: a network interdiction approach for metabolic engineering design." Bioinformatics 36, no. 11 (2020): 3482–92. http://dx.doi.org/10.1093/bioinformatics/btaa163.

Der volle Inhalt der Quelle

Annotation:

Abstract Motivation Flux balance analysis (FBA) based bilevel optimization has been a great success in redesigning metabolic networks for biochemical overproduction. To date, many computational approaches have been developed to solve the resulting bilevel optimization problems. However, most of them are of limited use due to biased optimality principle, poor scalability with the size of metabolic networks, potential numeric issues or low quantity of design solutions in a single run. Results Here, we have employed a network interdiction model free of growth optimality assumptions, a special cas

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Malaviya, Ajay, Chase Rainwater, and Thomas Sharkey. "Multi-period network interdiction problems with applications to city-level drug enforcement." IIE Transactions 44, no. 5 (2012): 368–80. http://dx.doi.org/10.1080/0740817x.2011.602659.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

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 (2013): 721–49. http://dx.doi.org/10.1007/s11081-013-9220-z.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

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.

Der volle Inhalt der Quelle

Annotation:

Most violent crimes happen in urban and suburban cities. With emerging tracking techniques, law enforcement officers can have real-time location information of the escaping criminals and dynamically adjust the security resource allocation to interdict them. Unfortunately, existing work on urban network security games largely ignores such information. This paper addresses this omission. First, we show that ignoring the real-time information can cause an arbitrarily large loss of efficiency. To mitigate this loss, we propose a novel NEtwork purSuiT game (NEST) model that captures the interaction

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

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 (2022): 1272–90. http://dx.doi.org/10.1287/ijoc.2021.1111.

Der volle Inhalt der Quelle

Annotation:

This study generalizes the r-interdiction median (RIM) problem with fortification to simultaneously consider two types of risks: probabilistic exogenous disruptions and endogenous disruptions caused by intentional attacks. We develop a bilevel programming model that includes a lower-level interdiction problem and a higher-level fortification problem to hedge against such risks. We then prove that the interdiction problem is supermodular and subsequently adopt the cuts associated with supermodularity to develop an efficient cutting-plane algorithm to achieve exact solutions. For the fortificati

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

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 (2013): 107–19. http://dx.doi.org/10.1016/j.ijcip.2013.04.002.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dissertationen zum Thema "Network interdiction problems"

1

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

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.

Der volle Inhalt der Quelle

Annotation:

This dissertation addresses five fundamental resource allocation problems on networks, all of which have applications to support Homeland Security or industry challenges. In the first application, we model and solve the strategic problem of minimizing the expected loss inflicted by a hostile terrorist organization. An appropriate allocation of certain capability-related, intent-related, vulnerability-related, and consequence-related resources is used to reduce the probabilities of success in the respective attack-related actions, and to ameliorate losses in case of a successful attack. Given t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Altner, Douglas S. "Advancements on problems involving maximum flows." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/24828.

Der volle Inhalt der Quelle

Annotation:

Thesis (Ph.D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2008.<br>Committee Chair: Ozlem Ergun; Committee Member: Dana Randall; Committee Member: Joel Sokol; Committee Member: Shabbir Ahmed; Committee Member: William Cook.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Akgun, Ibrahim. "The K-group maximum-flow network-interdiction problem." Thesis, Monterey, California. Naval Postgraduate School, 2000. http://hdl.handle.net/10945/32947.

Der volle Inhalt der Quelle

Annotation:

We study the K-group network-interdiction problem (KNIP) in which a "network user" attempts to maximize flow among K >/= 3 "node groups", while an "interdictor" interdicts (destroys) network arcs, using limited interdiction resources, to minimize this maximum flow. We develop two models to solve or approximately solve KNIP. The multi-partition network-interdiction model (MPNIM) is an approximating model. It partitions the node set N into K different subsets, each containing one prespecified node group, and interdicts arcs using limited resources so that the total capacity of uninterdicted arcs

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

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.

Der volle Inhalt der Quelle

Annotation:

Thesis (M.S. in Operations Research) Naval Postgraduate School, December 2001.<br>Thesis Advisor(s): Wood, R. Kevin. "December 2001." Includes bibliographical references (p. 35-36). Also Available online.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

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.

Der volle Inhalt der Quelle

Annotation:

Dans cette thèse, nous étudions le problème de l’Interdiction de l’Arbre Couvrant Minimal (IACM). Ce problème est un jeu à deux joueurs entre un opérateur de réseau et un interdicteur. Le premier détermine un Arbre Couvrant Minimal (ACM) dans un réseau. Limité par un budget, le second cherche à changer la topologie du réseau pour augmenter le poids de l’ACM. Deux types d’interdiction sont considérés : l’interdiction totale et l’interdiction partielle.Une arête totalement interdite est considérée comme absente tandis que le poids d’une arête partiellement interdite est augmentée d’une quantité

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

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.

Der volle Inhalt der Quelle

Annotation:

The master’s thesis focuses on the optimization models in logistics with emphasis on the network interdiction problem. The brief introduction is followed by two overview chapters - graph theory and mathematical programming. Important definitions strongly related to network interdiction problems are introduced in the chapter named Basic concepts of graph theory. Necessary theorems used for solving problems are following the definitions. Next chapter named Introduction to mathematical programming firstly contains concepts from linear programming. Definitions and theorems are chosen with respect

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Michalopoulos, Dennis Paul 1979. "Prioritization and optimization in stochastic network interdiction problems." 2008. http://hdl.handle.net/2152/18188.

Der volle Inhalt der Quelle

Annotation:

The goal of a network interdiction problem is to model competitive decision-making between two parties with opposing goals. The simplest interdiction problem is a bilevel model consisting of an 'adversary' and an interdictor. In this setting, the interdictor first expends resources to optimally disrupt the network operations of the adversary. The adversary subsequently optimizes in the residual interdicted network. In particular, this dissertation considers an interdiction problem in which the interdictor places radiation detectors on a transportation network in order to minimize the probabili

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Nehme, Michael Victor. "Two-person games for stochastic network interdiction : models, methods, and complexities." 2009. http://hdl.handle.net/2152/7512.

Der volle Inhalt der Quelle

Annotation:

We describe a stochastic network interdiction problem in which an interdictor, subject to limited resources, installs radiation detectors at border checkpoints in a transportation network in order to minimize the probability that a smuggler of nuclear material can traverse the residual network undetected. The problems are stochastic because the smuggler's origin-destination pair, the mass and type of material being smuggled, and the level of shielding are known only through a probability distribution when the detectors are installed. We consider three variants of the problem. The first is a St

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Network interdiction problems"

1

Smith, J. Cole, Mike Prince, and Joseph Geunes. "Modern Network Interdiction Problems and Algorithms." In Handbook of Combinatorial Optimization. Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4419-7997-1_61.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

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. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00374-6_26.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

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. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-48439-2_16.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

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. Elsevier, 2021. http://dx.doi.org/10.1016/b978-0-12-821187-8.00003-4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Network interdiction problems"

1

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. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/550.

Der volle Inhalt der Quelle

Annotation:

Preventing crimes or terrorist attacks in urban areas is challenging. Law enforcement officers need to respond quickly to catch the attacker on his escape route, which is subject to time-dependent traffic conditions on transportation networks. The attacker can strategically choose his escape path and driving speed to avoid being captured. Existing work on security resource allocation has not considered such scenarios with time-dependent strategies for both players. Therefore, in this paper, we study the problem of efficiently scheduling security resources for interdicting the escaping attacker

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

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. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/515.

Der volle Inhalt der Quelle

Annotation:

We study repeated network interdiction games with no prior knowledge of the adversary and the environment, which can model many real world network security domains. Existing works often require plenty of available information for the defender and neglect the frequent interactions between both players, which are unrealistic and impractical, and thus, are not suitable for our settings. As such, we provide the first defender strategy, that enjoys nice theoretical and practical performance guarantees, by applying the adversarial online learning approach. In particular, we model the repeated networ

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

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. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/625.

Der volle Inhalt der Quelle

Annotation:

Goal recognition, which is the task of inferring an agent’s goals given some or all of the agent’s observed actions, is one of the important approaches in bridging the gap between the observation and decision making within an observe-orient-decide-act cycle. Unfortunately, few researches focus on how to improve the utilization of knowledge produced by a goal recognition system. In this work, we propose a Markov Decision Process-based goal recognition approach tailored to a dynamic shortest-path local network interdiction (DSPLNI) problem. We first introduce a novel DSPLNI model and its solvabl

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

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.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Network interdiction problems"

1

Chauhan, Darshan Rajesh. Robust Maximum Flow Network Interdiction Problem. Portland State University Library, 2020. http://dx.doi.org/10.15760/etd.7315.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!