Journal article
A branching method for the fixed charge transportation problem
Omega (Oxford), v 38(5), pp 393-397
2010
Featured in Collection : UN Sustainable Development Goals @ Drexel
Abstract
This paper presents a branching method for the solution of the fixed charge transportation problem. Starting with a linear formulation of the problem, we develop the method which converges to the optimal solution. The method is based on the computation of a lower bound and an upper bound embedded within a branching process. We present a detailed numerical example to illustrate the proposed method.
Metrics
Details
- Title
- A branching method for the fixed charge transportation problem
- Creators
- Veena Adlakha - University of BaltimoreKrzysztof Kowalski - Connecticut Department of TransportationBenjamin Lev - Drexel University
- Publication Details
- Omega (Oxford), v 38(5), pp 393-397
- Publisher
- Elsevier
- Resource Type
- Journal article
- Language
- English
- Academic Unit
- Decision Sciences (and Management Information Systems)
- Web of Science ID
- WOS:000276630700017
- Scopus ID
- 2-s2.0-78650357269
- Other Identifier
- 991019169667704721
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
- Management
- Operations Research & Management Science