The multi-terminal maximum-flow network-interdiction problem (Q713097): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2156245899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-level programming and conflict resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Two-Sided Optimization for Theater Ballistic Missile Defense / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Network Interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal multicut and maximal integer multiflow: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global optimization algorithm for reliable network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / 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: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications / 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: A problem in network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the most vital link in a flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interdiction of a supply network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of Communication Networks with Survivability Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bilevel mixed-integer program for critical infrastructure protection planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Stackelberg strategy in nonzero-sum games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable network design under optimal and heuristic interdiction scenarios / 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: Interception in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic network interdiction / rank
 
Normal rank

Latest revision as of 19:05, 5 July 2024

scientific article
Language Label Description Also known as
English
The multi-terminal maximum-flow network-interdiction problem
scientific article

    Statements

    The multi-terminal maximum-flow network-interdiction problem (English)
    0 references
    0 references
    0 references
    0 references
    26 October 2012
    0 references
    OR in military
    0 references
    integer programming
    0 references
    network flows
    0 references
    network interdiction
    0 references
    0 references

    Identifiers