首页> 外文OA文献 >A computational comparison of the primal simplex and relaxation algorithms for solving minimum cost flow networks.

【2h】

A computational comparison of the primal simplex and relaxation algorithms for solving minimum cost flow networks.

机译：用于求解最小成本流网络的原始单纯形法和松弛算法的计算比较。

页面导航

摘要
著录项
相似文献
相关主题

摘要

http://archive.org/details/computationalcom00saga

机译：HTTP://archive.org/details/computational com00萨嘎

著录项

作者
Sagaser Michael Bernard;
展开▼
作者单位

展开▼
年度 1989
总页数
原文格式 PDF
正文语种 en_US
中图分类

相似文献

外文文献
中文文献
专利

1. A POLYNOMIAL TIME PRIMAL NETWORK SIMPLEX ALGORITHM FOR MINIMUM COST FLOWS [J] . Orlin JB. Mathematical Programming . 1997,第2期

机译：最小成本流的多项式时间原始网络简单算法
2. Visualization software of the network exterior primal simplex algorithm for the minimum cost network flow problem [J] . D. Andreou, K. Paparrizos, N. Samaras, Operational Research . 2007,第3期

机译：网络外部原始单纯形算法的可视化软件，用于解决成本最低的网络流量问题
3. Modified bounded dual network simplex algorithm for solving minimum cost flow problem with fuzzy costs based on ranking functions [J] . A. Ebrahimnejad, S. H. Nasseri, S. M. Mansourzadeh Journal of intelligent & fuzzy systems: Applications in Engineering and Technology . 2013,第1期

机译：基于排序函数的模糊成本最小成本流问题的改进有界双网络单纯形算法
4. A polynomial time primal network simplex algorithm for minimum cost flows [C] . James B. Orlin Annual ACM-SIAM symposium on Discrete algorithms;ACM-SIAM symposium on Discrete algorithms . 1996

机译：最小成本流的多项式时间原始网络单纯形算法
5. Infeasible primal-dual interior point algorithms for solving optimal power flow problems. [D] . Yan, Xihui. 1997

机译：无法解决的原始对偶内点算法，无法解决最佳潮流问题。
6. Relaxation and Simplex mathematical algorithms applied to the study of steady-state electrochemical responses of immobilized enzyme biosensors: Comparison with experiments [O] . V. Flexer, K.F.E. Pratt, F. Garay, -1

机译：松弛和单纯形数学算法应用于固定化酶生物传感器稳态电化学响应的研究：与实验的比较
7. Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems [O] . 1988

机译：改进了原始单纯形算法，用于最短路径，分配和最小成本流问题

A computational comparison of the primal simplex and relaxation algorithms for solving minimum cost flow networks.

摘要

著录项

相似文献

相关主题

期刊订阅