Representing inverses in pure network flow optimization

DOI10.1016/0377-2217(86)90301-2zbMath0582.90032OpenAlexW1986005130MaRDI QIDQ1068691

Richard E. Rosenthal

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)90301-2

zbMATH Keywords

special structurepure network flow probleminverse-tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05) Deterministic network models in operations research (90B10)

Related Items (1)

A survey of dynamic network flows

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal Capacity Scheduling—I
• A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System
• Microdata file merging through large-scale network technology
• An improved version of the out-of-kilter method and a comparative study of computer codes
• The factorization approach to large-scale linear programming
• Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
• A network simplex method
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Testing of a large-scale network optimization program
• 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
• Augmented Threaded Index Method For Network Optimization
• Inductive Proof of the Simplex Method
• Optimality and Computation of (σ, S) Policies in the Multi-Item Infinite Horizon Inventory Problem
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

This page was built for publication: Representing inverses in pure network flow optimization