Risk-Averse Shortest Path Interdiction (Q2830955): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.2016.0699 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2432207361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence Independent Lifting for Mixed-Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Network Interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Paths in Probabilistic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem in network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifted Cover Inequalities for 0-1 Integer Programs: Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence independent lifting in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm applied to planning the interdiction of stochastic networks / 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: On mixing sets arising in chance-constrained programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming approach for linear programs with probabilistic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distribution of the Time Through a Directed, Acyclic Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive least-expected time paths in stochastic, time-varying transportation and data networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Note on Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic shortest path problems with recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the history of the transportation and maximum flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance-Constrained Binary Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the online shortest path problem with limited arc cost dependencies / 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 / DOI
 
Property / DOI: 10.1287/IJOC.2016.0699 / rank
 
Normal rank

Latest revision as of 00:19, 20 December 2024

scientific article
Language Label Description Also known as
English
Risk-Averse Shortest Path Interdiction
scientific article

    Statements

    Risk-Averse Shortest Path Interdiction (English)
    0 references
    0 references
    0 references
    1 November 2016
    0 references
    stochastic network interdiction
    0 references
    chance constraint
    0 references
    mixed-integer programming
    0 references
    branch and cut
    0 references
    lifting
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references