Representing inverses in pure network flow optimization

DOI10.1016/0377-2217(86)90301-2MaRDI QIDQ1068691zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A network flow method for solving some inverse combinatorial optimization problems
• Design and Implementation of Data Structures for Generalized Networks
• Solving inverse spanning tree problems through network flow techniques
• Publication:4493260
• Combinatorial algorithms for inverse network flow problems

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3791941 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System
• A network simplex method
• An improved version of the out-of-kilter method and a comparative study of computer codes
• Augmented Threaded Index Method For Network Optimization
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
• Enhancements Of Spanning Tree Labelling Procedures For Network Optimization
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Inductive Proof of the Simplex Method
• Microdata file merging through large-scale network technology
• Optimal Capacity Scheduling—I
• Optimality and Computation of (σ, S) Policies in the Multi-Item Infinite Horizon Inventory Problem
• Testing of a large-scale network optimization program
• The factorization approach to large-scale linear programming

Cited in

(2)

• A survey of dynamic network flows
• On the structure of the basis inverse for the transportation problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068691)