Solving singularly constrained generalized network problems
From MaRDI portal
Cites work
- A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
- Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
- Augmented Threaded Index Method For Network Optimization
- Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3446921 (Why is no real title available?)
- Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
- Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- On the equivalence of some generalized network problems to pure network problems
- On the Generalized Transportation Problem
- Optimization of the flow through networks with gains
- Order in Logic and Integral Domains
- Solving Constrained Transportation Problems
Cited in
(6)- Solving embedded generalized network problems
- Network flow problems with one side constraint: A comparison of three solution methods
- Dynamic factorization in large-scale optimization
- Solution of constrained generalized transportation problems using the pivot and probe algorithm
- An efficient primal approach to bottleneck transportation problems
- Modeling the satellite placement problem as a network flow problem with one side constraint
This page was built for publication: Solving singularly constrained generalized network problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245161)
