Obtaining a good primal solution to the uncapacitated transportation problem

DOI10.1016/S0377-2217(01)00396-4zbMATH Open1107.90422MaRDI QIDQ1869409FDOQ1869409

Authors: R. Sharma, Saumya Prasad 

Publication date: 10 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Recommendations

• A new dual based procedure for the transportation problem
• A Heuristic for Obtaining and Initial Solution for the Transportation Problem
• On a nonbasic dual method for the transportation problem
• A non improving simplex algorithm for transportation problems
• scientific article; zbMATH DE number 26752

zbMATH Keywords

DistributionTransportation problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• A new dual based procedure for the transportation problem
• Dual Algorithms for Pure Network Problems

Cited In (3)

• A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies
• Title not available (Why is that?)
• Advanced algorithm for solving a transportation problem with five indicators and fixed cost

This page was built for publication: Obtaining a good primal solution to the uncapacitated transportation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869409)