On a Class of Capacitated Transportation Problems

DOI10.1287/mnsc.5.3.304zbMath0995.90513OpenAlexW2003713856MaRDI QIDQ2778609

Wagner, Harvey M.

Publication date: 12 May 2002

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.5.3.304

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (21)

An iterative algorithm for two level hierarchical time minimization transportation problem ⋮ A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem ⋮ Matching and scheduling of student-company-talks for a university it-speed dating event ⋮ A-stable block implicit methods containing second derivatives ⋮ An Operator Theory for a Class of Linear Fractional Programming Problems — I ⋮ Packing and covering with integral feasible flows in integral supply-demand networks ⋮ The Fredholm radius of an operator in potential theory. [Continuation] ⋮ Finding minimum-cost flows by double scaling ⋮ Fuzzy programming with hyperbolic membership functions for multiobjective capacitated transportation problem. ⋮ Solution of the Hitchcock problem with one single row capacity constraint per row by the Ford-Fulkerson method ⋮ Blocking pairs of polyhedra arising from network flows ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems ⋮ Multi-objective capacitated transportation problem with mixed constraint: a case study of certain and uncertain environment ⋮ Gainfree Leontief substitution flow problems ⋮ A Monge property for the \(d\)-dimensional transportation problem ⋮ Network Flow Optimization with Minimum Quantities ⋮ A transportation planning problem with transfer costs in uncertain environment ⋮ Strongly polynomial algorithm for two special minimum concave cost network flow problems ⋮ Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities ⋮ A bad network problem for the simplex method and other minimum cost flow algorithms

This page was built for publication: On a Class of Capacitated Transportation Problems