Solving Constrained Transportation Problems

DOI10.1287/opre.23.1.91zbMath0314.90052OpenAlexW1991616395MaRDI QIDQ4074660

Darwin D. Klingman, Roberta S. Russell

Publication date: 1975

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.23.1.91

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

Dynamic factorization in large-scale optimization, A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints, Solving transportation problems with nonlinear side constraints with tabu search, Network flow problems with one side constraint: A comparison of three solution methods, An algorithm for a fuzzy transportation problem to select a new type of coal for a steel manufacturing unit, The singly constrained assignment problem: An AP basis algorithm, Transportation problem with nonlinear side constraints a branch and bound approach, THE ALGORITHM OF FINDING ALL PARADOXICAL PAIRS IN A LINEAR TRANSPORTATION PROBLEM, Multi-index fixed charge bi-criterion transshipment problem, A network simplex method for the budget-constrained minimum cost flow problem, A specialized network simplex algorithm for the constrained maximum flow problem, Solving singularly constrained generalized network problems, Solution of constrained generalized transportation problems using the pivot and probe algorithm, Large-scale linear programming: Geometry, working bases and factorizations, The transportation problem with exclusionary side constraints and two branch-and-bound algorithms, Solving embedded generalized network problems, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm