On the integral plane two-commodity flow problem

1992 ◽  
Vol 11 (3) ◽  
pp. 135-139 ◽  
Author(s):  
Frieda Granot ◽  
Michal Penn
Keyword(s):  
Flow Problem ◽  
Commodity Flow ◽  
Integral Plane

scholarly journals A Multi-Commodity Flow Problem for Fair Resource Allocation in Multi-Path Video Delivery Networks

2020 ◽  
Vol 53 (2) ◽  
pp. 7386-7391
Author(s):  
Luca De Cicco ◽  
Gioacchino Manfredi ◽  
Vittorio Palmisano ◽  
Saverio Mascolo
Keyword(s):  
Resource Allocation ◽  
Flow Problem ◽  
Video Delivery ◽  
Commodity Flow ◽  
Delivery Networks

scholarly journals Multi-Agent Path Finding with Deadlines

2018 ◽  
Author(s):  
Hang Ma ◽  
Glenn Wagner ◽  
Ariel Felner ◽  
Jiaoyang Li ◽  
T. K. Satish Kumar ◽  
...  
Keyword(s):  
Flow Problem ◽  
Search Algorithms ◽  
The Other ◽  
Path Finding ◽  
Combinatorial Search ◽  
Programming Formulation ◽  
Commodity Flow ◽  
Linear Programming Formulation ◽  
Multi Agent ◽  
Integer Linear Programming Formulation

We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their given start vertices within the deadline, without colliding with each other. We first show that MAPF-DL is NP-hard to solve optimally. We then present two classes of optimal algorithms, one based on a reduction of MAPF-DL to a flow problem and a subsequent compact integer linear programming formulation of the resulting reduced abstracted multi-commodity flow network and the other one based on novel combinatorial search algorithms. Our empirical results demonstrate that these MAPF-DL solvers scale well and each one dominates the other ones in different scenarios.

Node Dependency in Multi-Commodity Flow Problem with Applications to Transportation Networks

CICTP 2016 ◽  
2016 ◽  
Author(s):  
Weibin Dai ◽  
Jun Zhang ◽  
Xiaoqian Sun ◽  
Sebastian Wandelt
Keyword(s):  
Flow Problem ◽  
Transportation Networks ◽  
Commodity Flow

Using agents for solving a multi-commodity-flow problem

2009 ◽  
Vol 194 (3) ◽  
pp. 888-900 ◽  
Author(s):  
Rene Weiskircher ◽  
Nectarios Kontoleon ◽  
Rodolfo Garcia-Flores ◽  
Simon Dunstall
Keyword(s):  
Flow Problem ◽  
Commodity Flow

BINDING ALGORITHM FOR POWER OPTIMIZATION BASED ON NETWORK FLOW METHOD

2002 ◽  
Vol 11 (03) ◽  
pp. 259-271 ◽  
Author(s):  
YOONSEO CHOI ◽  
TAEWHAN KIM
Keyword(s):  
Network Flow ◽  
Power Optimization ◽  
Flow Problem ◽  
Minimum Cost ◽  
Maximum Flow ◽  
Data Flow Graph ◽  
Commodity Flow ◽  
Behavioral Synthesis ◽  
Flow Problems ◽  
Step Procedure

We propose an efficient binding algorithm for power optimization in behavioral synthesis. In prior work, it has been shown that several binding problems for low-power can be formulated as multi-commodity flow problems (due to an iterative execution of data flow graph) and be solved optimally. However, since the multi-commodity flow problem is NP-hard, the application is limited to a class of small sized problems. To overcome the limitation, we address the problem of how we can effectively make use of the property of efficient flow computations in a network so that it is extensively applicable to practical designs while producing close-to-optimal results. To this end, we propose a two-step procedure, which (1) determines a feasible binding solution by partially utilizing the computation steps for finding a maximum flow of minimum cost in a network and then (2) refines it iteratively. Experiments with a set of benchmark examples show that the proposed algorithm saves the run time significantly while maintaining close-to-optimal bindings in most practical designs.

On the 3-Commodity Flow Problem

1969 ◽  
Vol 17 (1) ◽  
pp. 46-58 ◽  
Author(s):  
B. Rothfarb ◽  
I. T. Frisch
Keyword(s):  
Flow Problem ◽  
Commodity Flow
Sign in / Sign up

Export Citation Format

Share Document