On the structure of the fixed charge transportation problem

International Journal of Mathematical Education in Science and Technology

Volumn 36, Issue 8, 2005, Pages 879-888

  Kowalski, K ^a  

^a Connecticut Department of Transportation ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30344437018     PISSN: 0020739X     EISSN: None     Source Type: Journal    
DOI: 10.1080/00207390500137837     Document Type: Article

References (9)

1. Hirsch, W. and Danzig, G.B., 1968, The fixed charge problem, Naval Research Logistics Quarterly, 15, 413-424.
2. Adlakha, V. and Kowalski, K., 2003, A simple heuristic for solving small fixed-charge transportation problems, OMEGA: International Journal of Management Science, 27, 205-211.
3. Murty, K.G., 1968, Solving the fixed-charge problem by ranking the extreme points, Operations Research, 16, 268-279.
4. Sadagopan, S. and Ravindran, A., 1982, A vertex ranking algorithm for the fixed-charge transportation problem, Journal of Optimization Theory and Applications, 37, 221-230.
5. Gray, P., 1971, Exact solution of the fixed charge transportation problem, Operations Research, 19, 1529-1538.
6. Palekar, U.S., Karwan, M.H. and Zionts, S., 1990, A branch and bound method for the fixed charge transportation problem, Management Science, 36, 1092-1105.
7. Steinberg, D.I., 1970, The fixed charge problem, Naval Research Logistics Quarterly, 17, 217-235.
8. Adlakha, V. and Kowalski, K., 1999, A simple algorithm for the source-induced fixed-charge transportation problem, International Journal of Mathematical Education in Science and Technology, 30, 719-728.
9. Liu, S.-T., 2003, The total cost bounds of the transportation problem with varying demand and supply, OMEGA: International Journal of Management Science, 31, 247-251.