An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts (Q2458722): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.camwa.2006.05.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060631552 / 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: A simple algorithm for reliability evaluation of a stochastic-flow network with node failure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / 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: Multicommodity network flows—A survey / 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: 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 Two Commodity Network Flows / 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: Multistate reliability models / rank
 
Normal rank

Latest revision as of 11:28, 27 June 2024

scientific article
Language Label Description Also known as
English
An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts
scientific article

    Statements

    Identifiers