Skip to main content
SpringerLink
Log in

Minimum Concave Transportation Problems

MCTP

  • Reference work entry
Encyclopedia of Optimization

  • 200 Accesses

Article Outline

Keywords

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Balinski ML (1961) Fixed-cost transportation problems. Naval Res Logist 8:41–54

    Article  MATH  Google Scholar 

  2. Barr RS, Glover F, Klingman D (1981) A new optimization method for large scale fixed charge transportation problems. Oper Res 29:448–463

    Article  MathSciNet  MATH  Google Scholar 

  3. Bell GB, Lamar BW (1997) Solution methods for nonconvex network problems. In: Pardalos PM Hearn DW, Hager WW (eds) Network Optimization. Lecture Notes Economics and Math Systems. Springer, Berlin, pp 32–50

    Google Scholar 

  4. Cabot AV, Erenguc SS (1984) Some branch-and-bound procedures for fixed-cost transportation problems. Naval Res Logist 31:145–154

    Article  MathSciNet  MATH  Google Scholar 

  5. Diaby M (1991) Successive linear approximation procedure for generalized fixed-charge transportation problems. J Oper Res Soc 42:991–1001

    Article  MATH  Google Scholar 

  6. Florian M, Robilland P (1971) An implicit enumeration algorithm for the concave cost network flow problem. Managem Sci 18:184–193

    MATH  Google Scholar 

  7. Floudas CA, Pardalos PM (1990) A collection of test problems for constrained global optimization Algorithms. Lecture Notes Computer Sci, vol 455. Springer, Berlin

    MATH  Google Scholar 

  8. Gray P (1971) Exact solution of the fixed-charge transportation problem. Oper Res 19:1529–1538

    Article  MATH  Google Scholar 

  9. Guisewite GM, Pardalos PM (1990) Minimum concave-cost network flow problems: Applications, complexity, and algorithms. Ann Oper Res 25:75–100

    Article  MathSciNet  MATH  Google Scholar 

  10. Kendall KE, Zoints S (1977) Solving integer programming problems by aggregating constraints. Oper Res 25:346–351

    Article  MATH  Google Scholar 

  11. Kennington J (1976) The fixed-charge transportation problem: A computational study with a branch-and-bound code. AIIE Trans 8:241–247

    Google Scholar 

  12. Kennington J, Unger VE (1976) A new branch-and-bound algorithm for the fixed charge transportation problem. Managem Sci 22:1116–1126

    MathSciNet  MATH  Google Scholar 

  13. Khang DB, Fujiwara O (1991) Approximate solutions of capacitated fixed-charge minimum cost network flow problems. Networks 21:689–704

    Article  MathSciNet  MATH  Google Scholar 

  14. Kim D, Pardalos PM (1999) A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper Res Lett 24:195–203

    Article  MathSciNet  MATH  Google Scholar 

  15. Lamar BW (1993) An improved branch and bound algorithm for minimum concave cost network flow problems. J Global Optim 3:261–287

    Article  MathSciNet  MATH  Google Scholar 

  16. Lamar BW (1993) A method for solving network flow problems with general nonlinear arc costs. In: Du D-Z and Pardalos PM (eds) Network Optimization Problems: Algorithms, Applications, and Complexity. World Sci., Singapore, pp 147–167

    Google Scholar 

  17. Lamar BW, Wallace CA (1996) A comparison of conditional penalties for the fixed charge transportation problem. Techn. Report Dept. Management Univ. Canterbury

    Google Scholar 

  18. Lamar BW, Wallace CA (1997) Revised-modified penalties for fixed charge transportation problems. Managem Sci 43:1431–1436

    Google Scholar 

  19. Lawler EL (1976) Combinatorial optimization: Networks and matroids. Holt, Rinehart and Winston, New York

    MATH  Google Scholar 

  20. Palekar US, Karwan MH, Zionts S (1990) A branch-and-bound method for the fixed charge transportation problem. Managem Sci 36:1092–1105

    MathSciNet  MATH  Google Scholar 

  21. Rech P, Barton LG (1970) A non-convex transportation algorithm. In: Beale EML (ed) Applications of Mathematical Programming Techniques. English Univ. Press, London

    Google Scholar 

  22. Soland RM (1974) Optimal facility location with concave costs. Oper Res 22:373–382

    Article  MathSciNet  MATH  Google Scholar 

  23. Wagner HM (1959) On a class of capacitated transportation problems. Managem Sci 5:304–318

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Economic and Decision Analysis Center, The MITRE Corp., Bedford, USA

    Bruce W. Lamar

Authors
  1. Bruce W. Lamar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Lamar, B.W. (2008). Minimum Concave Transportation Problems . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_372

Download citation

Publish with us

Policies and ethics

Search

Navigation