Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Journal of Network and Systems Management
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
Fast deterministic approximation for the multicommodity flow problem
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On the first-order estimation of multipliers from Kuhn-Tucker systems
Computers and Operations Research
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
An Interior Point Algorithm for Large-Scale Nonlinear Programming
SIAM Journal on Optimization
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
SIAM Journal on Optimization
TEEN: ARouting Protocol for Enhanced Efficiency in Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Design of Capacitated Multicommodity Networks with Multiple Facilities
Operations Research
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Exact solution of multicommodity network optimization problems with general step cost functions
Operations Research Letters
| Hi-index | 0.00 |
In this paper, we propose a converting technique based method to solve nonlinear multi-commodity network flow (NMNF) problems with a large number of capacity constraints and discuss the associated implementation. We have combined this method with a successive quadratic programming (SQP) method and a parallel dual-type (PDt) method possessing decomposition effects. We have tested our method in solving a kind of lattice-type network system examples of NMNF problems. The simulation results show that the proposed algorithm is efficient for solving NMNF problems and successfully handles a large number of coupling capacity constraints. Furthermore, the computational efficiency of the proposed algorithm is more significant while the numbers of capacity constraints are increased.