Solving Constrained Transportation Problems
From MaRDI portal
Cited in
(19)- Large-scale linear programming: Geometry, working bases and factorizations
- A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
- Transportation problem with nonlinear side constraints a branch and bound approach
- The algorithm of finding all paradoxical pairs in a linear transportation problem
- Solving embedded generalized network problems
- Network flow problems with one side constraint: A comparison of three solution methods
- Dynamic factorization in large-scale optimization
- A specialized network simplex algorithm for the constrained maximum flow problem
- A network simplex method for the budget-constrained minimum cost flow problem
- An algorithm for a fuzzy transportation problem to select a new type of coal for a steel manufacturing unit
- A comprehensive simplex-like algorithm for network optimization and perturbation analysis
- The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- The singly constrained assignment problem: An AP basis algorithm
- Solving singularly constrained generalized network problems
- Solving transportation problems with nonlinear side constraints with tabu search
- Solution of a transshipment problem with uncertain parameters under impaired and enhanced flow
- Multi-index fixed charge bi-criterion transshipment problem
- Solution of constrained generalized transportation problems using the pivot and probe algorithm
This page was built for publication: Solving Constrained Transportation Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4074660)
