返回
THE MULTIPLE BOTTLENECK TRANSPORTATION PROBLEM
DOI:10.1016/0305-0548(93)90003-2.png)
摘要
En 中文
An extension to the Bottleneck Transportation Problem (BTP) is considered wherein a bottleneck is computed for each demand point. Due to the existence of local optima, solution procedures that have been developed for BTP do not readily apply to the Multiple Bottleneck Problem (MTP). An effective solution technique that uses Lagrangean relaxation methods is described and tested. One of the keys to the algorithm is a unique ''double bounding'' technique derived from the special structure of MTP.
Keyword:
LAGRANGIAN-RELAXATION
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
没有更多内容

