A hybrid algorithm for large-scale non-separable nonlinear multicommodity flow problems
We propose an approach for large-scale non-separable nonlinear multicommodity flow problems by solving a sequence of subproblems which can be addressed by commercial solvers. Using a combination of solution methods such as modified gradient projection, shortest path algorithm and golden section sear...
Main Authors: | Trung Hieu Tran, ThuBa T Nguyen, Yirui Jiang |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2023-03-01
|
Series: | Journal of Algorithms & Computational Technology |
Online Access: | https://doi.org/10.1177/17483026231157214 |
Similar Items
-
A scaling algorithm for multicommodity flow problems
by: Schneur, Rina., et al.
Published: (2009) -
Scaling algorithms for multicommodity flow problems and network flow problems with side constraits
by: Schneur, Rina
Published: (2005) -
Approximation algorithms for multicommodity flow and shop scheduling problems
by: Stein, Clifford
Published: (2005) -
Loops in multicommodity flows
Published: (2003) -
Stable Multicommodity Flows
by: Tamás Király, et al.
Published: (2013-03-01)