排序方式： 共有44条查询结果，搜索用时 0 毫秒
41.
42.
Patrick Mileham 《Whitehall Papers》2013,80(1):157-164
43.
To solve linear fixed charge problems with Murty's vertex ranking algorithm, one uses a simplex algorithm and a procedure to determine the vertices adjacent to a given vertex. In solving fixed charge transportation problems, the simplex algorithm simplifies to the stepping-stone algorithm. To find adjacent vertices on transportation polytopes, we present a procedure which is a simplification of a more general procedure for arbitrary polytopes. 相似文献
44.