Maximum flow in a network with fuzzy arc capacities (Q1167060): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Waldemar Kołodziejczyk / rank
Normal rank
 
Property / author
 
Property / author: Waldemar Kołodziejczyk / rank
 
Normal rank
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/0165-0114(82)90006-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014042800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision-Making in a Fuzzy Environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis in fuzzy linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy programming and linear programming with several objective functions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:23, 13 June 2024

scientific article
Language Label Description Also known as
English
Maximum flow in a network with fuzzy arc capacities
scientific article

    Statements

    Maximum flow in a network with fuzzy arc capacities (English)
    0 references
    0 references
    1982
    0 references
    fuzzy arc capacities
    0 references
    fuzzy goals
    0 references
    minimum cut
    0 references
    algorithm
    0 references
    maximal network flow
    0 references

    Identifiers

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