Cooperative maximum-flow problem under uncertainty in logistic networks (Q902866)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Cooperative maximum-flow problem under uncertainty in logistic networks	scientific article
American English	No label defined	No description defined

Statements

scholarly article

Cooperative maximum-flow problem under uncertainty in logistic networks (English)

zbMATH Open document ID

10.1016/j.amc.2014.10.080

Ashkan Hafezalkotob

Applied Mathematics and Computation

publication date

4 January 2016

Mathematics Subject Classification ID

zbMATH DE Number

zbMATH Keywords

maximum-flow problem

multiple-owners graph

logistics

robust optimization

reliability and stability

describes a project that uses

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.amc.2014.10.080

On the history of the transportation and maximum flow problems

Logistics networks: a game theory application for solving the transshipment problem

Cost allocation in collaborative forest transportation

Generalized Network Problems Yielding Totally Balanced Games

Robust Optimization of Large-Scale Systems

Strategic and tactical design of competing decentralized supply chain networks with risk-averse participants for markets with uncertain demand

A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure

The maximum flow problem of uncertain network

Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming

Robust solutions of linear programming problems contaminated with uncertain data

The Price of Robustness

Robust discrete optimization and network flows

On robust maximum flow with polyhedral uncertainty sets

Polynomial-time identification of robust network flows under uncertain arc failures

Totally Balanced Games and Games of Flow

Cost allocation: The traveling salesman, bin packing, and the knapsack

Cooperative game theory approach to allocating benefits of horizontal cooperation

A new algorithm for solving the feasibility problem of a network flow

The Cooperative Game Theory of Networks and Hierarchies

Models in Cooperative Game Theory

Sitelinks

Mathematics(1 entry)

mardi Publication:902866

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q902866&oldid=36221395"