Solving singularly constrained generalized network problems
From MaRDI portal
Publication:1245161
DOI10.1007/BF01442134zbMath0373.90075MaRDI QIDQ1245161
John Hultz, Darwin D. Klingman
Publication date: 1978
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Related Items (6)
Dynamic factorization in large-scale optimization ⋮ Network flow problems with one side constraint: A comparison of three solution methods ⋮ Modeling the satellite placement problem as a network flow problem with one side constraint ⋮ Solution of constrained generalized transportation problems using the pivot and probe algorithm ⋮ An efficient primal approach to bottleneck transportation problems ⋮ Solving embedded generalized network problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Solving Constrained Transportation Problems
- 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
- Augmented Threaded Index Method For Network Optimization
- On the Generalized Transportation Problem
- Order in Logic and Integral Domains
- Optimization of the flow through networks with gains
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- On the equivalence of some generalized network problems to pure network problems
This page was built for publication: Solving singularly constrained generalized network problems
