Theoretical and computational advances for network diversion (Q2811311): 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: Q4452912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On super i‐connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobility, sensing, and security management in wireless ad hoc sensor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interdicting a Nuclear-Weapons Project / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and applications. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for minimum weight odd circuits and cuts in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The network inhibition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cohesion and stability in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding <i>k</i> Disjoint Paths in a Directed Planar Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Discrete Model Representations via Symmetry Considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Solution to the Undirected Two Paths Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for mixed integer programming: A survey / rank
 
Normal rank

Latest revision as of 04:01, 12 July 2024

scientific article
Language Label Description Also known as
English
Theoretical and computational advances for network diversion
scientific article

    Statements

    Theoretical and computational advances for network diversion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 June 2016
    0 references
    network diversion
    0 references
    minimum cut
    0 references
    complexity
    0 references
    mixed-integer programming
    0 references
    valid inequality
    0 references
    0 references
    0 references

    Identifiers