Cooperative maximum-flow problem under uncertainty in logistic networks (Q902866): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Logistics networks: a game theory application for solving the transshipment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost allocation in collaborative forest transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Network Problems Yielding Totally Balanced Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Optimization of Large-Scale Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic and tactical design of competing decentralized supply chain networks with risk-averse participants for markets with uncertain demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum flow problem of uncertain network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust solutions of linear programming problems contaminated with uncertain data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On robust maximum flow with polyhedral uncertainty sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time identification of robust network flows under uncertain arc failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally Balanced Games and Games of Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost allocation: The traveling salesman, bin packing, and the knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative game theory approach to allocating benefits of horizontal cooperation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for solving the feasibility problem of a network flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cooperative Game Theory of Networks and Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models in Cooperative Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817870 / rank
 
Normal rank

Revision as of 06:18, 11 July 2024

scientific article
Language Label Description Also known as
English
Cooperative maximum-flow problem under uncertainty in logistic networks
scientific article

    Statements

    Cooperative maximum-flow problem under uncertainty in logistic networks (English)
    0 references
    0 references
    0 references
    4 January 2016
    0 references
    maximum-flow problem
    0 references
    multiple-owners graph
    0 references
    logistics
    0 references
    robust optimization
    0 references
    reliability and stability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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