Sequential Shortest Path Interdiction with Incomplete Information (Q4692013): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-time analysis of the multiarmed bandit problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonstochastic Multiarmed Bandit Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive routing with end-to-end feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the most vital arcs in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path network interdiction with asymmetric information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution approach for a class of nonlinear bilevel knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, Learning, and Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bandits / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>n</i> Most Vital Nodes in a Flow Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most vital links and nodes in weighted networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Network Interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the minimum source-sink path subject to a budget constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interdiction policy for a flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network interdiction via a critical disruption path: branch-and-price algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Governments' and Terrorists' Defense and Attack in a <i>T</i>-Period Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation and sampling to solve a stochastic network interdiction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically efficient adaptive allocation rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k most vital arcs in the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Adversarial Risk Analysis: A Level-<i>k</i> Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interdiction of a supply network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing a stochastic maximum-reliability path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the <i>n</i> Most Vital Links in Flow Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some aspects of the sequential design of experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3528714 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact identification of critical nodes in sparse networks via new compact formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming framework for critical elements detection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Critical Element Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Person Zero-Sum Games for Network Interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing Arcs from a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling costly learning and counter-learning in a defender-attacker game with private defender information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling secrecy and deception in a multiple-period attacker-defender signaling game / rank
 
Normal rank

Latest revision as of 02:21, 17 July 2024

scientific article; zbMATH DE number 6964290
Language Label Description Also known as
English
Sequential Shortest Path Interdiction with Incomplete Information
scientific article; zbMATH DE number 6964290

    Statements

    Sequential Shortest Path Interdiction with Incomplete Information (English)
    0 references
    0 references
    0 references
    0 references
    24 October 2018
    0 references
    0 references
    network interdiction
    0 references
    shortest path
    0 references
    \(k\)-most vital arcs
    0 references
    learning
    0 references
    incomplete information
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references