A Greedy Algorithm for Solving Ordinary Transportation Problem with Capacity Constraints

Consider the ordinary transportation problem with the objective to minimize the cost of transporting a single commodity from M warehouses to N demand locations. Each warehouse i has a finite capacity ki. We convert the above problem into a dual problem and construct a greedy algorithm to solve it

MoreLess

Year of publication:	2017
Authors:	Liu, Fang
Publisher:	[2017]: [S.l.] : SSRN
Subject:	Theorie \| Theory \| Transportproblem \| Transportation problem \| Algorithmus \| Algorithm \| Ganzzahlige Optimierung \| Integer programming
Description of contents:	Abstract [papers.ssrn.com] ; Abstract [doi.org]

Check Google Scholar |

More access options

In German libraries (KVK)

I need help

Extent:	1 Online-Ressource
Type of publication:	Book / Working Paper
Language:	English
Notes:	Nach Informationen von SSRN wurde die ursprüngliche Fassung des Dokuments January 10, 2017 erstellt Volltext nicht verfügbar
Other identifiers:	10.2139/ssrn.2896544 [DOI]
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10012965872