Consideration on a nonlinear multicommodity flow problem in a packet switching network

1986 ◽  
Vol 69 (12) ◽  
pp. 29-35
Author(s):  
Kaoru Kurosawa ◽  
Takayuki Hasebe
Keyword(s):  
Packet Switching ◽  
Flow Problem ◽  
Switching Network ◽  
Multicommodity Flow ◽  
Multicommodity Flow Problem

Multicommodity Flow Problem with Variable Arcs Capacities

1978 ◽  
Vol 29 (5) ◽  
pp. 459-467 ◽  
Author(s):  
Jacques A. Ferland ◽  
Andre Girard ◽  
Louis Lafond
Keyword(s):  
Flow Problem ◽  
Multicommodity Flow ◽  
Multicommodity Flow Problem

A simulation-optimization approach for the stochastic discrete cost multicommodity flow problem

2019 ◽  
Vol 52 (3) ◽  
pp. 507-526
Author(s):  
Imen Mejri ◽  
Safa Bhar Layeb ◽  
Mohamed Haouari ◽  
Farah Zeghal Mansour
Keyword(s):  
Flow Problem ◽  
Simulation Optimization ◽  
Multicommodity Flow ◽  
Optimization Approach ◽  
Multicommodity Flow Problem

scholarly journals A polyhedral approach to an integer multicommodity flow problem

2000 ◽  
Vol 101 (1-3) ◽  
pp. 13-36 ◽  
Author(s):  
Lorenzo Brunetta ◽  
Michele Conforti ◽  
Matteo Fischetti
Keyword(s):  
Flow Problem ◽  
Multicommodity Flow ◽  
Multicommodity Flow Problem ◽  
Polyhedral Approach

A multicommodity flow problem

Networks ◽  
1974 ◽  
Vol 4 (3) ◽  
pp. 267-280
Author(s):  
E. Kant
Keyword(s):  
Flow Problem ◽  
Multicommodity Flow ◽  
Multicommodity Flow Problem

scholarly journals Maximum Multicommodity Flow with Intermediate Storage

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Durga Prasad Khanal ◽  
Urmila Pyakurel ◽  
Tanka Nath Dhamala
Keyword(s):  
Continuous Time ◽  
Flow Problem ◽  
Natural Transformation ◽  
Capacity Constraints ◽  
Multicommodity Flow ◽  
Flow Problems ◽  
Transit Times ◽  
Multicommodity Flow Problem ◽  
Intermediate Storage

The multicommodity flow problem deals with the transshipment of more than one commodity from respective sources to corresponding sinks without violating the capacity constraints. Due to the capacity constraints, flows out from the sources may not reach their sinks, and so, the storage of excess flows at intermediate nodes plays an important role in the maximization of flow values. In this paper, we introduce the maximum static as well as maximum dynamic multicommodity flow problems with intermediate storage. We present polynomial and pseudopolynomial time algorithms for the former and latter problems, respectively. We also present the solution procedures to these problems in contraflow network having symmetric as well as asymmetric arc transit times. We transform the solutions in continuous-time settings by using natural transformation.

Sign in / Sign up

Export Citation Format

Share Document