An improved disaggregation method for transportation problems
Publication
, Journal Article
Zipkin, P; Raimer, K
Published in: Mathematical Programming
1983
A method is given to disaggregate the solution to an aggregated transportation problem. The resulting solution to the original problem is feasible, all-integer, and has lower cost that those of solutions produced by earlier methods. © 1983 North-Holland Publishing Company.
Duke Scholars
Published In
Mathematical Programming
DOI
ISSN
0025-5610
Publication Date
1983
Volume
26
Issue
2
Start / End Page
238 / 242
Related Subject Headings
- Operations Research
- 0802 Computation Theory and Mathematics
- 0103 Numerical and Computational Mathematics
- 0102 Applied Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Zipkin, P., & Raimer, K. (1983). An improved disaggregation method for transportation problems. Mathematical Programming, 26(2), 238–242. https://doi.org/10.1007/BF02592058
Zipkin, P., and K. Raimer. “An improved disaggregation method for transportation problems.” Mathematical Programming 26, no. 2 (1983): 238–42. https://doi.org/10.1007/BF02592058.
Zipkin P, Raimer K. An improved disaggregation method for transportation problems. Mathematical Programming. 1983;26(2):238–42.
Zipkin, P., and K. Raimer. “An improved disaggregation method for transportation problems.” Mathematical Programming, vol. 26, no. 2, 1983, pp. 238–42. Scival, doi:10.1007/BF02592058.
Zipkin P, Raimer K. An improved disaggregation method for transportation problems. Mathematical Programming. 1983;26(2):238–242.
Published In
Mathematical Programming
DOI
ISSN
0025-5610
Publication Date
1983
Volume
26
Issue
2
Start / End Page
238 / 242
Related Subject Headings
- Operations Research
- 0802 Computation Theory and Mathematics
- 0103 Numerical and Computational Mathematics
- 0102 Applied Mathematics