首页> 外文OA文献 >Minimum-cost flows in networks with upper bounded arcs and concave cost functions.

【2h】

Minimum-cost flows in networks with upper bounded arcs and concave cost functions.

机译：具有上界弧和凹成本函数的网络中的最小成本流。

页面导航

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

摘要

Approved for public release; distribution in unlimited.

机译：批准公开发布；无限分发。

著录项

作者
Hallenbeck Wayne Jay.;
展开▼
作者单位

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

相似文献

外文文献
中文文献
专利

1. Upper Bounds for Single-Source Uncapacitated Concave Minimum-Cost Network Flow Problems [J] . Dalila B. M. M. Fontes, Eleni Hadjiconstantinou, Nicos Christofides Networks . 2003 ,第4期

机译：单源无容量凹形最小成本网络流问题的上限
2. A GENETIC ALGORITHM FOR THE DESIGN OF MINIMUM-COST TWO-CONNECTED NETWORKS WITH BOUNDED RINGS [J] . BEATRICE M. OMBUKI International Journal of Computational Intelligence and Applications . 2005 ,第2期

机译：带环最小成本二联网络设计的遗传算法
3. Minimum-Cost Flows in Unit-Capacity Networks [J] . Goldberg Andrew V., Hed Sagi, Kaplan Haim, Theory of computing systems . 2017 ,第4期

机译：单位容量网络中的最小成本流
4. Solving the Minimum-Cost Satisfiability Problem Using SAT Based Branch-and-Bound Search [C] . Zhaohui Fu, Sharad Malik IEEE/ACM International Conference on Computer Aided Design . 2006

机译：使用基于SAT的分支和绑定搜索解决最小成本满足性问题
5. Minimum-concave-cost flows in series-parallel networks. [D] . Ward, Julie A. 1995

机译：串联-并联网络中的最小凹面成本流。
6. Optimal-Flow Minimum-Cost Correspondence Assignment in Particle Flow Tracking [O] . Alexandre Matov, Marcus M. Edvall, Ge Yang, -1

机译：最优流量最低成本函授分配粒子流跟踪
7. Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks [O] . DAngelo Gianlorenzo, Di Stefano Gabriele, Navarra Alfredo 2011

机译：多接口网络中的最大流量和最小成本流量

Minimum-cost flows in networks with upper bounded arcs and concave cost functions.

摘要

著录项

相似文献

相关主题

期刊订阅