Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes (Q2370349): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2006.09.082 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999617901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Method for Reliability Evaluation of a Communication System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity network flows—A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistate reliability models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliability evaluation of a limited-flow network in terms of minimal cutsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reliability evaluation of a capacitated‐flow network in terms of minimal pathsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Study on the multicommodity reliability of a capacitated-flow network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithm for reliability evaluation of a stochastic-flow network with node failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-commodity reliability evaluation for a stochastic-flow network with node failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Two Commodity Network Flows / rank
 
Normal rank

Latest revision as of 09:34, 26 June 2024

scientific article
Language Label Description Also known as
English
Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes
scientific article

    Statements

    Generate upper boundary vectors meeting the demand and budget for a \(p\)-commodity network with unreliable nodes (English)
    0 references
    0 references
    25 June 2007
    0 references
    reliability
    0 references
    \(p\)-commodity
    0 references
    limited-flow networks
    0 references
    budget
    0 references
    upper boundary vectors
    0 references
    unreliable nodes
    0 references

    Identifiers