.png){kind=icon}
返回
A branching method for the fixed charge transportation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2009.10.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a branching method for the solution of the fixed charge transportation problem. Starting with a linear formulation of the problem, we develop the method which converges to the optimal solution. The method is based on the computation of a lower bound and an upper bound embedded within a branching process. We present a detailed numerical example to illustrate the proposed method. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Transportation
Fixed charge
Iterative method
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.8K
被引数:
1.4W
机构
引用论文
Preparation of pyridyl-terminated oligodimethylsiloxane and siloxane-grafted copolymers containing pyridyl groups at the side chain ends.png)
Polymer
PolymerIF0
PREAI
分享收藏分享收藏Replacing Soybean Meal with Urea in Diets for Heavy Fattening Lambs: Effects on Growth, Metabolic Profile and Meat QualityAnimals
OAAI
AnimalsIF0
OAAI分享收藏
查看更多内容