An iterative solution technique to minimize the average transportation cost of capacitated transportation problem with bounds on rim conditions
From MaRDI portal
Publication:5149536
Recommendations
- More for less method to minimize the unit transportation cost of a capacitated transportation problem with bounds on rim conditions
- An iterative solution technique for capacitated two-stage time minimization transportation problem
- Bottleneck capacitated transportation problem with bounds on rim conditions
- RC-MMM method for finding an optimal solution for transportation problem
- scientific article; zbMATH DE number 4041624
Cites work
- A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
- A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies
- A Simplex-Type Algorithm for General Transportation Problems: An Alternative to Stepping-Stone
- Algorithms for solving the single-sink fixed-charge transportation problem
- An iterative algorithm for two level hierarchical time minimization transportation problem
- Capacitated transportation problem with bounds on rim conditions
- Capacitated two-stage time minimization transportation problem
- Concealment measurement and flow distribution of military supply transportation: a double-entropy model
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- Mass transportation problems with capacity constraints
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- More for less method to minimize the unit transportation cost of a capacitated transportation problem with bounds on rim conditions
- Network flows. Theory, algorithms, and applications.
- Note—The Distribution Problem with Upper and Lower Bounds on the Node Requirements
- On lower bounds for the fixed charge problem
- Postoptimality Analyses of the Transportation Problem
- Probabilistic Analysis of the Capacitated Transportation Problem
- The Distribution of a Product from Several Sources to Numerous Localities
- The minimal average cost flow problem
- The stepping stone method of explaining linear programming calculations in transportation problems
- Two level hierarchical time minimizing transportation problem
Cited in
(11)- On a class of capacitated transshipment problems with bounds on rim conditions
- More for less method to minimize the unit transportation cost of a capacitated transportation problem with bounds on rim conditions
- An iterative solution technique for capacitated two-stage time minimization transportation problem
- An alternate approach to solve two-level priority based assignment problem
- Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities
- Capacitated transportation problem under 2-vehicle
- A hybrid simulated annealing algorithm to estimate a better upper bound of the minimal total cost of a transportation problem with varying demands and supplies
- A solution technique for capacitated two-level hierarchical time minimization transportation problem
- An efficient solution approach to capacitated bilevel time minimizing transportation problem
- An iterative solution approach to capacitated two-stage time minimization transportation problem with destination-stage demand specified
- Capacitated transportation problem with bounds on rim conditions
This page was built for publication: An iterative solution technique to minimize the average transportation cost of capacitated transportation problem with bounds on rim conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149536)
