Reoptimization procedures for bounded variable primal simplex network algorithms

DOI10.1016/0377-2217(86)90245-6zbMath0578.90088OpenAlexW2035625333MaRDI QIDQ1066818

Ellen P. Allen, Richard S. Barr, Jeffrey L. Kennington, Agha Iqbal Ali

Publication date: 1986

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(86)90245-6

zbMATH Keywords

decompositionbounded variable primal simplex network algorithmsnetwork subprogramreoptimization process

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items (6)

The equal flow problem ⋮ Transportation problem with nonlinear side constraints a branch and bound approach ⋮ Network reoptimization procedures for multiobjective network problems ⋮ Updating network flows given multiple, heterogeneous arc attribute changes ⋮ Future paths for integer programming and links to artificial intelligence ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Multicommodity Distribution System Design by Benders Decomposition
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• Solving fixed charge network problems with group theory-based penalties
• An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Solving the Pipe Network Analysis Problem Using Optimization Techniques
• Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Validation of subgradient optimization
• Augmented Threaded Index Method For Network Optimization

This page was built for publication: Reoptimization procedures for bounded variable primal simplex network algorithms