Results 161 to 170 of about 381 (184)

Multicommodity Flow Requirements

2001
In this chapter we consider the minimum network synthesis problem with non-simultaneous multicommodity flow requirements when both edge capacities and flows are required to be integer. Since exact methods cannot currently solve realistic sized instances of this problem, we have developed a tabu search heuristic to find good feasible solutions in ...
openaire   +1 more source

Minimum-Cost Multicommodity Network Flows

Operations Research, 1966
The minimum-cost multicommodity network flow problem is formulated in both node-arc and arc-chain form, leading to very large linear programs. The special structure of these programs is utilized in algorithms for their solution.
openaire   +1 more source

An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks

SIAM Journal on Computing, 1985
Takao Nishizeki
exaly  

Optimal Dynamic Multicommodity Flows in Networks

Electronic Notes in Discrete Mathematics, 2006
Dmitrii Lozovanu, Maria Fonoberova
exaly  

A Specialized Interior-Point Algorithm for Multicommodity Network Flows

SIAM Journal on Optimization, 2000
Jordi Castro
exaly  

An implementation of linear and nonlinear multicommodity network flows

European Journal of Operational Research, 1996
J Castro
exaly  

Multicommodity network flows

2001
openaire   +1 more source

Substitutes, complements, and ripples in multicommodity flows on suspension graphs

Networks, 2014
Frieda Granot, Arthur F Veinott
exaly  

Speeding up Karmarkar's algorithm for multicommodity flows

Mathematical Programming, 1996
Sanjiv Kapoor
exaly  

Simulation of Packing, Distribution and Routing of Small-Size Discrete Flows in a Multicommodity Network

Journal of Automation and Information Sciences, 2015
Vladimir A Vasyanin
exaly