Files and links (1)
Published, Version of Record (VoR)CC BY-NC-ND V4.0, Open
Journal article
A fast and simple branching algorithm for solving small scale fixed-charge transportation problem
Operations Research Perspectives, v 1(1)
01 Mar 2014
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
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. (C) 2014 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license.
Metrics
Details
- Title
- A fast and simple branching algorithm for solving small scale fixed-charge transportation problem
- Creators
- Krzysztof Kowalski - Connecticut Department of TransportationBenjamin Lev - Drexel UniversityWenjing Shen - Drexel UniversityYan Tu - Drexel University
- Publication Details
- Operations Research Perspectives, v 1(1)
- Publisher
- Elsevier
- Number of pages
- 5
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Decision Sciences (and Management Information Systems)
- Web of Science ID
- WOS:000219687600001
- Scopus ID
- 2-s2.0-84925052578
- Other Identifier
- 991019169649004721
UN Sustainable Development Goals (SDGs)
This publication has contributed to the advancement of the following goals:
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- Web of Science research areas
- Operations Research & Management Science