Reoptimization procedures for bounded variable primal simplex network algorithms-Reference-Cited by-同舟云学术

Reoptimization procedures for bounded variable primal simplex network algorithms

Published:1986-02 Issue:2 Volume:23 Page:256-263
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Ali A.Iqbal,Allen Ellen P.,Barr Richard S.,Kennington Jeffery L.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference20 articles.

1. Computational comparison among three multicommodity network flow algorithms;Ali;Operations Research,1980

2. Enhancements to spanning tree labeling procedures for network optimization;Barr;INFOR,1979

3. A new optimization method for large scale fixed charge transportation problems;Barr;Operations Research,1981

4. Design and implementation of large-scale transshipment algorithms;Bradley;Management Science,1977

5. Solving the pipe network analysis problem using optimization techniques;Collins;Management Science,1978

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Updating Network Flows Given Multiple, Heterogeneous Arc Attribute Changes;Journal of Mathematical Modelling and Algorithms;2010-02-25

2. Goal network programs: A specialized algorithm and an application;European Journal of Operational Research;1998-04

3. A comprehensive simplex-like algorithm for network optimization and perturbation analysis;Optimization;1995-01

4. Transportation problem with nonlinear side constraints a branch and bound approach;ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research;1992-03

5. Reoptimization procedures for networks with side constraints;Computers & Industrial Engineering;1991-01