An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1200264
- Interior dual proximal point algorithm using preconditioned conjugate gradient †
- POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
- scientific article; zbMATH DE number 1047679
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
Cited in
(11)- A hybrid algorithm for the solution of a single commodity spatial equilibrium model
- Solving scalarized multi-objective network flow problems using an interior point method
- Convex relaxations for permutation problems
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
- Extremal Points and an Algorithm for a Class of Continuous Transportation Problems
- Exterior point simplex-type algorithms for linear and network optimization problems
- Fortran subroutines for network flow optimization using an interior point algorithm
- scientific article; zbMATH DE number 146408 (Why is no real title available?)
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- Computational experience with exterior point algorithms for the transportation problem
This page was built for publication: An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4895602)