A fast and simple branching algorithm for solving small scale fixed-charge transportation problem

Krzysztof Kowalski, Benjamin Lev, Wenjing Shen, Yan Tu

In this paper, we develop a simple algorithm for obtaining the global solution to a small scale fixed-charge transportation problem (FCTP). The procedure itself is very quick. The proposed method solves FCTP by decomposing the problem into series of smaller sub-problems, which is novel and can be useful to researchers solving any size of the problem.

MoreLess

Year of publication:	March 2014
Authors:	Kowalski, Krzysztof ; Lev, Benjamin ; Shen, Wenjing ; Tu, Yan
Published in:	Operations research perspectives. - Amsterdam [u.a.] : Elsevier, ISSN 2214-7160, ZDB-ID 2821932-6. - Vol. 1.2014, 1, p. 1-5
Subject:	Transportation problem \| Fixed charge \| Branching method \| Transportproblem \| Mathematische Optimierung \| Mathematical programming \| Theorie \| Theory \| Algorithmus \| Algorithm \| Branch-and-Bound \| Branch and Bound \| Heuristik \| Heuristics

freely available

Full text |

More access options

doi.org

www.sciencedirect.com

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

Type of publication:	Article
Type of publication (narrower categories):	Aufsatz in Zeitschrift ; Article in journal
Language:	English
Other identifiers:	10.1016/j.orp.2014.03.001 [DOI] hdl:10419/178241 [Handle]
Source:	ECONIS - Online Catalogue of the ZBW

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