On the equivalence of some generalized network problems to pure network problems

DOI10.1007/BF01584670zbMath0259.90012MaRDI QIDQ5675130

Fred Glover, Darwin D. Klingman

Publication date: 1973

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items

Transformations Enlarging the Network Portion of a Class or LP/Embedded Generalized Networks, Karmarkar's projective algorithm: A null space variant for multi- commodity generalized networks, The structure of bases in bicircular matroids, A Strongly Polynomial Algorithm for Generalized Flow Maximization, Solving singularly constrained generalized network problems, Engpässe, Staustellen und glatte homogene Ströme in Netzen

Cites Work

• Unnamed Item
• Unnamed Item
• New Methods in Mathematical Programming—Optimal Flow Through Networks with Gains
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
• On the Generalized Transportation Problem
• The Generalized Stepping Stone Method for the Machine Loading Model
• The Dual Method for the Generalized Transportation Problem
• One-Pass Algorithms for Some Generalized Network Problems
• Basic Dual Feasible Solutions for a Class of Generalized Networks