Network Problems

  • G. M. Guisewite
Chapter
Part of the Nonconvex Optimization and Its Applications book series (NOIA, volume 2)

Abstract

Network problems arise naturally in many application areas. For the case of nonconvex network optimization, it is often necessary to exploit the network structure to develop efficient algorithms. This paper summarizes the application areas, complexity, and solution techniques for popular network problems. Network formulations for numerous application areas are provided. A summary of complexity results for concave and indefinite problems, as well as for specific network structures is discussed. Classes of algorithms that have been used to solve network problems are summarized along with any reported performance results.

Key words

network problems nonconvex optimization complexity algorithms applications 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahuja, R.K. (1986), “Algorithms for the Minimax Transportation Problem”, Naval Research Logistics Quarterly, Vol. 33, 725–739.MathSciNetMATHGoogle Scholar
  2. 2.
    Akinc, U. and Khumawala, B.M. (1977) “An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem,” Management Science, Vol. 23, 585–594.MathSciNetMATHGoogle Scholar
  3. 3.
    Assad, A.A. (1978), “Multicommodity Network Flows - A Survey”, Networks, Vol. 8, 37–91.MathSciNetMATHGoogle Scholar
  4. 4.
    Balachandran, V. and Perry, A. (1976), “Transportation Type Problems with Quantity Discounts,” Naval Research Logistics Quarterly, Vol. 23, 195–209.MathSciNetMATHGoogle Scholar
  5. 5.
    Balakrishnan, A. and Graves, S.C. (1989), “A Composite Algorithm for a Concave-Cost Network Flow Problem,” Networks 19, 175–202.MathSciNetMATHGoogle Scholar
  6. 6.
    Balinski, M.L. (1961), “Fixed Cost Transportation Problems,” Naval Research Logistics Quarterly, Vol. 8, No. 1, 41–54.MathSciNetMATHGoogle Scholar
  7. 7.
    Balinski, M.L. and Quandt, R.E. (1964), “On an Integer Program for a Delivery Problem,” Operations Research, Vol. 12, No. 2, 300–304.Google Scholar
  8. 8.
    Barr, R.S., Glover, F. and Klingman, D. (1981), “A New Optimization Method for Large Scale Fixed Charge Transportation Problems,” Operations Research, Vol. 29, No.3, 448–463.MathSciNetMATHGoogle Scholar
  9. 9.
    Baumol, W.J. and Wolfe, P. (1958), “A Warehouse-Location Problem,” Operations Research, Vol. 6, No. 2, 252–263.MathSciNetGoogle Scholar
  10. 10.
    Baybars, I. and Edahl, R.H. (1988), “A Heuristic Method for Facility Planning in Telecommunications Networks With Multiple Alternate Routes,” Naval Research Logistics Quarterly, Vol. 35, No. 4, 503–528.MathSciNetMATHGoogle Scholar
  11. 11.
    Beasley, J.E. (1984), “An Algorithm for the Steiner Problem in Graphs,” Networks, Vol. 14, 147–159.MathSciNetGoogle Scholar
  12. 12.
    Beasley, J.E. (1989), “An SST-Based Algorithm for the Steiner Problem in Graphs,” Networks, Vol. 19, 1–16.MathSciNetMATHGoogle Scholar
  13. 13.
    Bertsekas, D.P. and Tsitsiklis, J.N. (1989), Parallel and Distributed Computation, Prentice Hall, New Jersey.MATHGoogle Scholar
  14. 14.
    Bhatia, H.L. (1981), “Indefinite Quadratic Solid Transportation Problem,” Journal of Information and Optimization Sciences, Vol. 2, No. 3, 297–303.MathSciNetMATHGoogle Scholar
  15. 15.
    Bookbinder, J.H. and Sethi, S.P. (1980), “The Dynamic Transportation Problem: A Survey,” Naval Research Logistics Quarterly, Vol. 27, 65–87.MathSciNetMATHGoogle Scholar
  16. 16.
    Bornstein, C.T. and Rust, R. (1988), “Minimizing a Sum of Staircase Functions Under Linear Constraints,” Optimization, Vol. 19, No. 2, 181–190.MathSciNetMATHGoogle Scholar
  17. 17.
    Bulatov, V.P. (1988), “The Immersion Method for the Global Mimimization of Functions on the Convex Polyhedra,” International Symposium on Engineering, Mathematics, and Applications, Beijing, China (July 1988), 335–338.Google Scholar
  18. 18.
    Cabot, A.V. and Erenguc, S.S. (1984). “Some Branch-and-Bound Procedures for Fixed-Cost Transportation Problems,” Naval Research Logistics Quarterly, Vol. 31, 145–154.MathSciNetMATHGoogle Scholar
  19. 19.
    Charnes, A. and Cooper, W.W. (1961), Management Models and Industrial Applications of Linear Programming, John Wiley and Sons, Inc., New York.MATHGoogle Scholar
  20. 20.
    Cooper, L. (1975), “The Fixed Charge Problem-I: A New Heuristic Method,” Comp. 6 Maths. with Appls., Vol 1, 89–95.MATHGoogle Scholar
  21. 21.
    Cooper, L. and Drebes, C. (1968), “An Approximate Solution Method for the Fixed-Charge Problem,” Naval Research Logistics Quarterly, Vol. 14, No. 1, 101–113.Google Scholar
  22. 22.
    Crainic, T.G. , Florian, M., and Leal, J.(1990), “A Model for the Strategic Planning of National Freight Transportation by Rail,” Transportation Science, Vol. 24, No. 1, 1–24.Google Scholar
  23. 23.
    Daeninck, G. and Smeers, Y. (1977), “Using Shortest Paths in Some Transshipment Problems With Concave Costs,” Mathematical Programming, Vol. 12, 18–25.MathSciNetMATHGoogle Scholar
  24. 24.
    Dantzig, G.B. (1963), Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey.MATHGoogle Scholar
  25. 25.
    Davis, P.S. and Ray, T.L. (1969), “A Branch-Bound Algorithm for the Capacitated Facilities Location Problem,” Naval Research Logistics Quarterly, Vol. 16, 331–344.MATHGoogle Scholar
  26. 26.
    Dembo, R.S., Mulvey, J.M., and Zenios, S.A. (1989), “Large-Scale Nonlinear Network Models And Their Application,” Operations Research, Vol. 37, No. 3, 353–372.MathSciNetMATHGoogle Scholar
  27. 27.
    Denzler, D.R. (1969), “An Approximate Algorithm for the Fixed Charge Problems,” Naval Research Logistics Quarterly, Vol. 16, No. 3, 411–416.MATHGoogle Scholar
  28. 28.
    DingZhu Du and Pardalos, P.M. (eds)(1993), Network Optimization Problems: Algorithms, Complexity and Applications, World Scientific.Google Scholar
  29. 29.
    Dreyfus, S.E. and Wagner, R.A. (1971), “The Steiner Problem in Graphs,” Networks, Vol. 1, 195–207.MathSciNetGoogle Scholar
  30. 30.
    Driebeek, N. (1966), “An Algorithm for the Solution of Mixed Integer Programming Problems,” Management Science, Vol. 12, No. 7, 576–587.Google Scholar
  31. 31.
    Duin, C.W. and Volgenant, A. (1989), “An Edge Elimination test for the Steiner Problem in Graphs,” Operations Research Letters, Vol. 8, 79–83.MathSciNetMATHGoogle Scholar
  32. 32.
    Duin, C.W. and Volgenant, A. (1989), “Reduction Tests for the Steiner Problem in Graphs,” Networks, Vol. 19, 549–567.MathSciNetMATHGoogle Scholar
  33. 33.
    Efroymson, M.A. and Ray, T.L. (1966), “A Branch-Bound Algorithm for Plant Location,” Operations Research, Vol. 14, No. 3, 361–368.Google Scholar
  34. 34.
    Eggleston, H.G. (1963), Convexity, Cambridge Tracts in Mathematics and Mathematical Physics No. 47, Cambridge University Press, Cambridge, Mass.Google Scholar
  35. 35.
    Erickson, R.E., Monma, C.L., and Veinott, Jr., A.F. (1987), “Send-and-Split Method for Minimum-Concave-Cost Network Flows,” Mathematics of Operations Research, Vol. 12, No. 4, 634–664.MathSciNetMATHGoogle Scholar
  36. 36.
    Erlenkotter, D. (1967), “Two Producing Areas- Dynamic Programming Solutions,” in: A.S. Manne (ed.), Investment for Capacity Expansion: Size, Location and Time Phasing, MIT Press, Cambridge, Mass., 210–227. 36Google Scholar
  37. 37.
    Falk, J.E. and Soland, R.M. (1969), “An Algorithm for Separable Nonconvex Programming Problems,” Management Science, Vol. 15, No. 9, 550–569.MathSciNetMATHGoogle Scholar
  38. 38.
    Fisk, J. and McKeown, P. (1979) “The Pure Fixed Charge Transportation Problem,” Naval Research Logistics Quarterly, Vol. 26, 631–641.MATHGoogle Scholar
  39. 39.
    Florian, M. (1984), “An Introduction to Network Models Used in Transportation Planning,” Transportation Planning Models, Elsevier Publishers, New York.Google Scholar
  40. 40.
    Florian, M. (1986), “Nonlinear Cost Network Models in Transportation Analysis,” Mathematical Programming Study 26, 167–196.MathSciNetMATHGoogle Scholar
  41. 41.
    Florian, M. and Klein, M. (1971), “Deterministic Production Planning With Concave Costs and Capacity Constraints,” Management Science, Vol. 18, No. 1, 12–20.MathSciNetGoogle Scholar
  42. 42.
    Florian, M., Lenstra, J.K. and Rinnooy Kan, A.H.G. (1980), “Deterministic Production Planning: Algorithms and Complexity,” Management Science, Vol. 26, No. 7,669–679.MathSciNetMATHGoogle Scholar
  43. 43.
    Florian, M. and Robillard, P. (1971), “An Implicit Enumeration Algorithm for the Concave Cost Network Flow Problem,” Management Science, Vol. 18, No. 3, 184–193.MATHGoogle Scholar
  44. 44.
    Florian, M., Rossin-Arthiat, M., and de Werra, D. (1971), “A Property of Minimum Concave Cost Flows in Capacitated Networks,” Canadian Journal of Operations Research, Vol. 9, 293–304.Google Scholar
  45. 45.
    Fong, C.O. and Rao, M.R. (1975), “Capacity Expansion With Two Producing Regions and Concave Costs,” Management Science, Vol. 22, No. 3, 331–339.MathSciNetMATHGoogle Scholar
  46. 46.
    Ford, Jr., L.R. and Fulkerson, D.R. (1962), Flows in Networks, Princeton University Press, Princeton, New Jersey.MATHGoogle Scholar
  47. 47.
    Gallo, G., Sandi, C., and Sodini, C. (1980), “An Algorithm for the Min Concave Cost Flow Problem,” European Journal of Operations Research, Vol. 4, 249–255.MathSciNetGoogle Scholar
  48. 48.
    Gallo, G. and Sodini, C. (1979), “Adjacent Extreme Flows and Application to Min Concave-Cost Flow Problems,” Networks 9, 95–121.MathSciNetMATHGoogle Scholar
  49. 49.
    Garey, M.R., Graham, R.L., and Johnson, D.S. (1976), “Some NP-complete Geometric Problems,” Proceedings of the 8’th Annual ACM Symposium on Theory of Computing, 10–22.Google Scholar
  50. 50.
    Garey, M.R., Graham, R.L., and Johnson, D.S. (1977), “The Complexity of Computing Steiner Minimal Trees,” Siam J. Appl. Math., Vol. 32, 835–859.MathSciNetMATHGoogle Scholar
  51. 51.
    Garey, M.R. and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, CA.MATHGoogle Scholar
  52. 52.
    Graves, S.C. and Orlin, J.B. (1985), “A Minimum Concave-Cost Dynamic Network Flow Problem With an Application to Lot-Sizing,” Networks, Vol. 15, 59–71.MathSciNetMATHGoogle Scholar
  53. 53.
    Gray, P. (1971), “Exact Solution of the Fixed-Charge Transportation Problem,” Operations Research, Vol. 19, No. 6, 1529–1538.MATHGoogle Scholar
  54. 54.
    Grinold, R.C. (1972), “The Payment Scheduling Problem”, Naval Research Logistics Quarterly, Vol. 19, 123–136.MathSciNetMATHGoogle Scholar
  55. 55.
    Guelat, J., Florian, M., and Powell, W.B. (1990), “A Multimode Multiproduct Network Assignment Model for Strategic Planning of Freight Flows,” Transportation Science, Vol. 24, No. 1, 25–39.MATHGoogle Scholar
  56. 56.
    Guisewite, G.M. and Pardalos, P.M. (1990), “Minimum Concave-Cost Network Flow Problems: Applications, Complexity, and Algorithms,” Annals of Operations Research, Vol. 25, 75–100.MathSciNetMATHGoogle Scholar
  57. 57.
    Guisewite, G.M. and Pardalos, P.M. (1990), “Single-Source Uncapacitated Minimum Concave-Cost Network Flow Problems,” Operational Research’90, 703–713.Google Scholar
  58. 58.
    Guisewite, G.M. and Pardalos, P.M. (1991), “Global Search Algorithms for Minimum Concave-Cost Network Flow Problems,” Journal of Global Optimization, Vol. 1, 309–330.MathSciNetGoogle Scholar
  59. 59.
    Guisewite, G.M. and Pardalos, P.M. (1991), “Algorithms for the Single-Source Uncapacitated Minimum Concave-Cost Network Flow Problem,” Journal of Global Optimization, Vol. 1, 245–265.MathSciNetMATHGoogle Scholar
  60. 60.
    Guisewite, G.M. and Pardalos, P.M. (1992), “Performance of Local Search in Minimum Concave-Cost Network Flow Problems,” Recent Advances in Global Optimization, Princeton University Press, 50–75.Google Scholar
  61. 61.
    Guisewite, G.M. and Pardalos, P.M. (1993), “A Polynomial Time Solvable Concave Network Flow Problem,” Networks, Vol. 23, 143–147.MathSciNetMATHGoogle Scholar
  62. 62.
    Guisewite, G.M. and Pardalos, P.M. (1993), “Parallel Computing in Nonconvex Programming,” To appear in Annals of Operations Research. Google Scholar
  63. 63.
    Guisewite, G.M. and Pardalos, P.M. (1993), “Complexity Issues in Nonconvex Network Flow Problems,” To appear in : P.M. Pardalos (ed.) Complexity in Numerical Optimization, World Scientific.Google Scholar
  64. 64.
    Hakimi, S.L. (1971), “Steiner’s Problem in Graphs and It’s Implications,” Networks, Vol. 1, 113–133.MathSciNetMATHGoogle Scholar
  65. 65.
    Haley, K.B. (1962), “The Solid Transportation Problem,” Operations Research Quarterly, Vol. 10, No. 3, 448–463.MathSciNetMATHGoogle Scholar
  66. 66.
    Hall, R..W. (1989), “Graphical Interpretation of the Transportation Problem,” Transportation Science, Vol. 23, No. 1, 37–45.MathSciNetMATHGoogle Scholar
  67. 67.
    Hamacher, H.W. and Tufekci, S. (1987), “On The Use of Lexicographic Min Cost Flows in Evacuation Modeling,” Naval Research Logistics Quarterly, Vol. 34, 487–503.MathSciNetMATHGoogle Scholar
  68. 68.
    Hefley, G.L. and Barr, B.O. (1973), “Fixed Charge Transportation Problem: A Survey,” Presented to the 43’rd ORSA National Meeting in Milwaukee, Wisconsin (May 1973).Google Scholar
  69. 69.
    Hochbaum, D.S. and Segev, A. (1989), “Analysis of a Flow Problem With Fixed Charges,” Networks, Vol. 19, 291–312.MathSciNetMATHGoogle Scholar
  70. 70.
    Horst, R. and Thy, H. (1990), Global Optimization: Deterministic Approaches, Springer-Verlag, N.Y.MATHGoogle Scholar
  71. 71.
    Ibaraki, T. and Katoh, N. (1988), Resource Allocation Problems, Algorithmic Approaches, The MIT Press, Cambridge, Mass.MATHGoogle Scholar
  72. 72.
    Jarvis, J.J., Unger, V.E., Rardin, R.L., and Moore, R.W. (1978), “Optimal Design of Regional Wastewater Systems: A Fixed Charge Network Flow Model,” Operations Research, Vol. 26, No. 4, 538–550.MATHGoogle Scholar
  73. 73.
    Jogannathan, R. and Rao, M.R. (1973), “A Class of Deterministic Production Planning Models,” Management Science, Vol. 19, No. 11, 1295–1300.Google Scholar
  74. 74.
    Johnson, L.A. and Montgomery, D.C. (1974), Operations Research in Production Planning, Scheduling, and Inventory Control, John Wiley and Sons, Inc., New York, 212–224.Google Scholar
  75. 75.
    Karp, R.M. (1972), “Reducibility Among Combinatorial Problems,” In: R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 85–104.Google Scholar
  76. 76.
    Kennedy, D. (1988), “Some Branch and Bound Techniques for Nonlinear Optimization,” Mathematical Programming, Vol. 42, 147–169.MathSciNetMATHGoogle Scholar
  77. 77.
    Kennington, J. (1976), “The Fixed-Charge Transportation Problem: A Computational Study With a Branch-and-Bound Code,” AILE Transactions, Vol. 8, No. 2, 241–247.Google Scholar
  78. 78.
    Kennington, J. and Unger, E. (1973), “The Group-Theoretic Structure in the Fixed-Charge Transportation Problem,” Operations Research, Vol. 21, No. 5, 1142–1152.MATHGoogle Scholar
  79. 79.
    Kennington, J. and Unger, E. (1976), “A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Algorithm,” Management Science, Vol. 22, No. 10, 1116–1126.MathSciNetMATHGoogle Scholar
  80. 80.
    Khang, D.B. and Fujiwara, O. (1991), “Approximate Solutions of Capacitated Fixed-Charge Minimum Cost Network Flow Problems,” Networks Vol. 21, 689–704.MathSciNetMATHGoogle Scholar
  81. 81.
    Khumawala, B.M. (1972), “An Efficient Branch and Bound Algorithm for the Warehouse Location Problem,” Management Science, Vol. 18, No. 12, B718–B731.MATHGoogle Scholar
  82. 82.
    Klincewicz, J.G. (1989), “Solving a Freight Transport Problem Using Facility Location Techniques,” Operations Research Vol,. 38, No. 1, 99–109.Google Scholar
  83. 83.
    Klingman, D. , Randolph, P.H. and Fuller, S.W. (1976), “A Cotton Ginning Problem,” Operations Research, Vol. 24, No. .4, 700–717.Google Scholar
  84. 84.
    Klinz, B. and Thy, H. (1993), “Minimum Concave-Cost Network Flow Problems with a Single Nonlinear Arc Cost,” To appear in: DingZhu Du and P.M. Pardalos (eds.) Network Optimization Problems. Google Scholar
  85. 85.
    Konno, H. (1973), “Minimum Concave Series Production System With Deterministic Demands: A Backlogging Case,” Journal of the Operations Research Society of Japan, Vol. 16, 246–253.MATHGoogle Scholar
  86. 86.
    Konno, H. (1988), “Minimum Concave Cost Production System: Multi-Echelon Model,” Mathematical Programming, Vol. 41, 185–193.MathSciNetMATHGoogle Scholar
  87. 87.
    Kuhn, H.W. and Baumol, W.J. (1962), “An Approximate Algorithm for the Fixed-Charge Transportation Problem,” Naval Research Logistics Quarterly, Vol. 9, No. 1, 1–16.MathSciNetMATHGoogle Scholar
  88. 88.
    Lamar, B.W. (1993), “An Improved Branch and Bound Algorithm for Minimum Concave Cost Network Flow Problems,” To appear in Journal of Global Optimization.Google Scholar
  89. 89.
    Lamar, B.W. (1993), “A Method for Optimizing Network Flow Problems with General Nonlinear Arc Costs,” To appear in DingZhu Du and P.M. Pardalos (eds.) Network Optimization Problems. Google Scholar
  90. 90.
    Lamar, B.W., Sheffi, Y., and Powell, W.B. (1990), “A Capacity Improvement Lower Bound for Fixed Charge Network Design Problems,” Operations Research Vol. 38, No. 4, 704–710.MATHGoogle Scholar
  91. 91.
    LeBlanc, L.J. (1978), “Global Solutions for a Nonconvex, Nonconcavg Rail Network Model,” Mathematical Science, Vol. 23, 131–139.MathSciNetGoogle Scholar
  92. 92.
    Lee, S. and Zipkin, P.H. (1989), “A Dynamic Lot-Size Model With Make-or-Buy Decisions,” Management Science, Vol. 35, No. 4, 447–458.MathSciNetMATHGoogle Scholar
  93. 93.
    Linial, N. (1986), “Hard Enumeration Problems in Geometry and Combinatorics,” SIAM J. Alg. Discr. Meth., Vol. 7, No. 2, 331–335.MathSciNetMATHGoogle Scholar
  94. 94.
    Linn, L.S. and Allen, J. (1986), “Minplex- A Compactor That Minimizes the Bounding Rectangle and Individual Rectangles in a Layout,” 23rd Design Automation Conference, 123–129.Google Scholar
  95. 95.
    Lippman, S.A. (1969), “Optimal Inventory Policy With Multiple Set-up Costs,” Management Science, Vol. 16, No. 1, 118–138.MathSciNetMATHGoogle Scholar
  96. 96.
    Love, S.F. (1972), “A Facilities in Series Inventory Model With Nested Schedules,” Management Science, Vol. 18, No. 5, 327–338.MATHGoogle Scholar
  97. 97.
    Love, S.F. (1973), “Bounded Production and Inventory Models With Piecewise Concave Costs,” Management Science, Vol. 20, No. 3, 313–318.MathSciNetMATHGoogle Scholar
  98. 98.
    Lozovanu, D.D.(1983). “Properties of Optimal Solutions of a Grid Transport Problem With Concave Function of the Flows on the Arcs,” Engineering Cybernetics, Vol 20, 34–38.MathSciNetGoogle Scholar
  99. 99.
    Luss, H. (1980), “A Network Flow Approach for Capacity Expansion Problems with Two Facility Types,” Naval Research Logistics Quarterly, Vol. 27, 597–608.MathSciNetMATHGoogle Scholar
  100. 100.
    Magnanti, T.L. and Wong, R.T.(1984), “Network Design and Transportation Planning: Models and Algorithms,” Transportation Science, Vol. 18, No. 1, 1–55.Google Scholar
  101. 101.
    Manne, A.S. and Veinott, Jr., A.F. (1967), “Optimal Plant Size With Arbitrary Increasing Time Paths of Demand,” in: A.S. Manne (ed.), Investments for Capacity Expansion: Size, Location and Time Phasing, MIT Press, Cambridge, Mass., 178–190.Google Scholar
  102. 102.
    McKeown, P.G. (1975), “A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem,” Operations Research, Vol. 23, No. 6, 1183–1191.MathSciNetMATHGoogle Scholar
  103. 103.
    McKeown, P.G. (1980), “Solving Incremental Quantity Discounted Transportation Problems by Vertex Ranking,” Naval Research Logistics Quarterly, Vol. 27, 437–445.MathSciNetMATHGoogle Scholar
  104. 104.
    McKeown, P.G. and Rubin, D.S.(1975), “Adjacent Vertices on Transportation Polytopes,” Naval Research Logistics Quarterly, Vol. 22, 365–374.MathSciNetMATHGoogle Scholar
  105. 105.
    Minoux, M. (1976), “Mulitflots De Coût Minimal Avec Fonctions De Coût Concaves,” Annals of Telecommunication, Vol 31, No 3–4, 77–92.MATHGoogle Scholar
  106. 106.
    Murty, K.G. (1968), “Solving the Fixed Charge Problem by Ranking the Extreme Points,” Operations Research, Vol. 16, No. 2, 268–279.MATHGoogle Scholar
  107. 107.
    Murty, K.G. and Kabadi, S.N. (1987), “Some NP-Complete Problems in Quadratic and Non-linear Programming,” Mathematical Programming, Vol. 39, 117–129.MathSciNetMATHGoogle Scholar
  108. 108.
    Orden, A. (1956), “The Transshipment Problem,” Management Science, Vol. 2, No. .3, 276–285.MathSciNetMATHGoogle Scholar
  109. 109.
    Palekar, U.S., Karwan, M.H., and Zionts, S. (1990), “A Branch-and-Bound Method for the Fixed Charge Transportation Problem,” Management Science, Vol. 36, No. 9, 1092–1105.MathSciNetMATHGoogle Scholar
  110. 110.
    Pardalos, P.M. (1988), “Enumerative Techniques for Solving Some Nonconvex Global Optimization Problems,” OR Spectrum 10, 29–35.MathSciNetMATHGoogle Scholar
  111. 111.
    Pardalos, P.M. (1989), “Parallel Search Algorithms in Global Optimization,” Applied Mathematics and Computation, 29, 219–229.MathSciNetMATHGoogle Scholar
  112. 112.
    Pardalos, P.M., Glick, J.H., and Rosen, J.B. (1987), “Global Minimization of Indefinite Quadratic Problems,” Computing 39, 281–291.MathSciNetMATHGoogle Scholar
  113. 113.
    Pardalos, P.M., Phillips, A.T. and Rosen, J.B. (1992), Topics in Parallel Computing in Mathematical Programming, Science press.Google Scholar
  114. 114.
    Pardalos, P.M. and Rosen, J.B. (1986), “Global Minimization of Large-Scale Constrained Concave Quadratic Problems by Separable Programming,” Mathematical Programming 34, 163–174.MathSciNetGoogle Scholar
  115. 115.
    Pardalos, P.M. and Rosen, J.B. (1986), “Global Concave Minimization: A Bibliographic Survey,” SIAM Review, Vol. 28, No. 3 367–379.MathSciNetMATHGoogle Scholar
  116. 116.
    Pardalos, P.M. and Rosen, J.B. (1987), Constrained Global Optimization: Algorithms and Applications, Lecture Notes in Computer Science 268, Springer-Verlag, Berlin.Google Scholar
  117. 117.
    Pardalos, P.M. and Schnitger, G. (1988), “Checking Local Optimality in Constrained Quadratic Programming is NP-hard,” Operations Research Letters, Vol. 7, No. 1, 33–35.MathSciNetMATHGoogle Scholar
  118. 118.
    Pardalos, P.M. and Vavasis, S.A. (1990), “Quadratic Programming With One Negative Eigenvalue is NP-hard,” Working Paper, Department of Computer Science, The Pennsylvania State University, University Park, PA.Google Scholar
  119. 119.
    Peltsverger, B.V. and Shafir, A.Y. (1990), “The Interactive Fixed Charge Inhomogeneous Flow Optimization Problem,” Annals of Operations Research, Vol. 25, 223–242.MathSciNetGoogle Scholar
  120. 120.
    Phillips, A.T. (1988) “Parallel Algorithms for Constrained Optimization,” Ph.D. Dissertation, University of Minnesota, Minneapolis, MN.Google Scholar
  121. 121.
    Phillips, A.T. and Rosen, J.B. (1988), “A Parallel Algorithm for Constrained Concave Quadratic Global Minimization,” Mathematical Programming, Vol. 42, 421–448.MathSciNetMATHGoogle Scholar
  122. 122.
    Plasil, J. and Chlebnican, P. (1989), “A New Algorithm for the Concave Cost Flow Problem,” Working Paper, Technical University of Transport and Communications, Zilina, Czechoslovakia.Google Scholar
  123. 123.
    Polyak, R. (1968), “On a Nonconvex Problem,” Soviet Math Doklady, Vol. 17a, No. 4, 786–789.MathSciNetGoogle Scholar
  124. 124.
    Provan, J.S. (1988), “Convexity and the Steiner Tree Problem,” Networks, Vol. 18, 55–72.MathSciNetMATHGoogle Scholar
  125. 125.
    Rao, R.C. and Shaftel, T.L. (1980), “Computational Experience on an Algorithm for the Transportation Problem With Nonlinear Objective Functions,” Naval Research Logistics Quarterly, Vol. 27, 145–157.MATHGoogle Scholar
  126. 126.
    Rardin, R.L. and Unger, V.E. (1976), “Solving Fixed Charge Network Problems with Group Theory-Based Penalties,” Naval Research Logistics Quarterly, Vol. 23, 67–83.MathSciNetMATHGoogle Scholar
  127. 127.
    Rech P. and Barton L.G.(1970), “A Non-Convex Transportation Algorithm,” in: E.M.L. Beale (ed.), Applications of Mathematical Programming Techniques, The English Universities Press LTD, London, 250–260.Google Scholar
  128. 128.
    Revelle, C., Marks, D. and Liebman, J.C. (1970), “An Analysis of Private and Public Sector Location Models,” Management Science, Vol 16, No. 11, 692–707.MATHGoogle Scholar
  129. 129.
    Rosen, J.B. (1983), “Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain,” Mathematics of Operations Research, Vol. 8, No. 2, 215–230.MathSciNetMATHGoogle Scholar
  130. 130.
    Rosenthal, R.E. (1981), “A Nonlinear Network Flow Algorithm for Maximization of Benefits in a Hydroelectric Power System,” Operations Research, Vol. 29, No. 4, 763–786.MathSciNetMATHGoogle Scholar
  131. 131.
    Sahni, S. and Gonzalez, T. (1976), “P-complete Approximation Problems,” J. Assoc. Corn-put. Mach., Vol. 23, 555–565.MathSciNetMATHGoogle Scholar
  132. 132.
    Schaffer, J.R. and O’Leary, D.E. (1989), “Use of Penalties in a Branch and Bound Procedure for the Fixed Charge Transportation Problem,” European Journal of Operations Research, Vol. 43, 305–312.MATHGoogle Scholar
  133. 133.
    Shetty, B. (1990), “A Heuristic Algorithm for a Network Problem with Variable Upper Bounds,” Networks Vol. 20, 373–389.MathSciNetMATHGoogle Scholar
  134. 134.
    Shetty, B. (1990), “A Relaxation/Decomposition Algorithm for the Fixed Charge Network Problem,” Naval Research Logistics, Vol. 37, 327–340.MathSciNetMATHGoogle Scholar
  135. 135.
    Shore, M.L., Foulds, L.R., and Gibbons, P.B. (1982), “An Algorithm for the Steiner Problem in Graphs,” Networks Vol. 12, 323–333.MathSciNetMATHGoogle Scholar
  136. 136.
    Sobel, M.J. (1970), “Smoothing Start-up and Shut-down Costs: Concave Case,” Management Science, Vol. 17, No. 1, 78–91.MathSciNetMATHGoogle Scholar
  137. 137.
    Soland, R.M. (1974), “Optimal Facility Location With Concave Costs,” Operations Research, Vol. 22, No. 2, 373–382.MathSciNetMATHGoogle Scholar
  138. 138.
    Spielberg, K. (1969), “An Algorithm for the Simple Plant Location Problem With Some Side Conditions,” Operations Research, Vol. 17, No. 1. 85–111.MathSciNetMATHGoogle Scholar
  139. 139.
    Spielberg, K. (1969), “Plant Location With Generalized Search Origin,” Management Science, Vol. 16, No. 3, 165–178.Google Scholar
  140. 140.
    Spielberg, K. (1970), “On Solving Plant Location Problems,” in: E.M.L. Beale (ed.), Applications of Mathematical Programming Techniques, The English Universities Press LTD, London, 216–234.Google Scholar
  141. 141.
    Steinberg, D.I. (1970), “The Fixed Charge Problem,” Naval Research Logistics Quarterly, Vol. 17, 217–236.MathSciNetMATHGoogle Scholar
  142. 142.
    Stroup, J.W. (1967), “Allocation of Launch Vehicles to Space Missions: A Fixed-Cost Transportation Problem,” Operations Research, Vol. 15, No. 11, 1157–1163.Google Scholar
  143. 143.
    Swoveland, C. (1975), “A Deterministic Multi-Period Production Planning Model With Piecewise Concave Production and Holding-Backorder Costs,” Management Science, Vol. 21, No. 9, 1007–1013.MathSciNetMATHGoogle Scholar
  144. 144.
    Taha, H.A. (1973), “Concave Minimization Over a Convex Polyhedron,” Naval Research Logistics Quarterly, Vol. 20, No. 3, 533–548.MathSciNetMATHGoogle Scholar
  145. 145.
    Thach, P.T. (1989), “An Efficient Method for Min Concave Cost Flow Problems Under Circuitless Single-Source Uncapacitated Networks,” Technical Report, Technical University of Graz, Austria.Google Scholar
  146. 146.
    Thach, P.T. (1990), “A Decomposition Method for the Min Concave Cost Flow Problem with a Staircase Structure,” Japan J. Appl. Math., 103–120.Google Scholar
  147. 147.
    Thach, P.T. (1992), “A Decomposition Method Using a Pricing Mechanism for Min Concave Cost Flow Problems with a Hierarchical Structure,” Mathematical Programming, Vol. 53, 339–359.MathSciNetMATHGoogle Scholar
  148. 148.
    Thach, P.T., and Konno, H. (1993), “A Decomposition Method for Lot-Sizing Problems with p-Concave Cost Functions,” Private communication.Google Scholar
  149. 149.
    Thoai, N.V. and Thy, H. (1980), “Convergent Algorithms for Minimizing a Concave Function,” Mathematics of Operations Research, Vol. 5, No. 4, 556–566.MathSciNetMATHGoogle Scholar
  150. 150.
    Toint, P.L. and Tuyttens, D. (1990), “On Large Scale Nonlinear Network Optimization” Mathematical Programming, Vol. 48, 125–159.MathSciNetMATHGoogle Scholar
  151. 151.
    Tomlin, J.A. (1966), “Minimum-Cost Multicommodity Network Flows,” Operations Research, Vol. 14, No. 1, 45–51.Google Scholar
  152. 152.
    Thy, H. (1964), “Concave Programming Under Linear Constraints,” Soviet Math Doklady, 1437–1440.Google Scholar
  153. 153.
    Valiant, L.G., and Vazirani, V.V. (1985), “NP Is as Easy as Detecting Unique Solutions,” 17’th STOC of the ACM, 458–463.Google Scholar
  154. 154.
    VanRoy, T.J., and Wolsey, L.A. (1987), “Solving Mixed Integer Programming Problems Using Automatic Reformulation,” Operations Research, Vol. .95, No. 1, 45–57.MathSciNetGoogle Scholar
  155. 155.
    Vavasis, S.A. (1991), Nonlinear Optimization: Complexity Issues, Oxford University Press, N.Y.MATHGoogle Scholar
  156. 156.
    Veinott, Jr., A.F. (1969), “Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems,” Operations Research, Vol. 17, No. 2, 262–291.MathSciNetMATHGoogle Scholar
  157. 157.
    Wagner, H.M. (1959), “On a Class of Capacitated Transportation Problems,” Management Science, Vol. 5, No. 1, 304–318.MathSciNetMATHGoogle Scholar
  158. 158.
    Wagner, H.M. (1960), A Postscript to “Dynamic Problems in the Theory of the Firm,” Naval Research Logistics Quarterly, Vol. 7, 7–12.Google Scholar
  159. 159.
    Wagner, H.M. and Whitin, T.M. (1958), “Dynamic Version of the Economic Lot Size Model,” Management Science, Vol 5, No. 1, 89–96.MathSciNetMATHGoogle Scholar
  160. 160.
    Walker, W.E. (1976), “A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem,” Management Science, Vol. 22, No. 5, 587–596.MATHGoogle Scholar
  161. 161.
    Winter, P. (1987), “Steiner Problem in Networks, A Survey,” Networks Vol. 17, 129–167.MATHGoogle Scholar
  162. 162.
    Yaged, Jr., B.(1971), “Minimum Cost Routing for Static Network Models,” Networks, Vol. 1, 139–172.MathSciNetMATHGoogle Scholar
  163. 163.
    Zadeh, N. (1973), “On Building Minimum Cost Communication Networks,” Networks, Vol. 3, 315–331.MathSciNetMATHGoogle Scholar
  164. 164.
    Zadeh, N. (1974), “On Building Minimum Cost Communication Networks Over Time,” Networks, Vol. 4, 19–34.Google Scholar
  165. 165.
    Zangwill, W.I. (1966), “A Deterministic Multi-Period Production Scheduling Model With Backlogging,” Management Science, Vol 13, No. 1, 105–119.MATHGoogle Scholar
  166. 166.
    Zangwill, W.I. (1966), “Production Smoothing of Economic Lot Sizes With Non-decreasing Requirements,” Management Science, Vol 13, No. 3, 191–209.MATHGoogle Scholar
  167. 167.
    Zangwill, W.I. (1968), “Minimum Concave-Cost Flows in Certain Networks,” Management Science, Vol. 14, No. 7, 429–450.MathSciNetMATHGoogle Scholar
  168. 168.
    Zangwill, W.I. (1969), “A Backlogging Model and a Multi-echelon Model of a Economic Lot Size Production System- A Network Approach,” Management Science, Vol. 15, No. 9, 506–527.MATHGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1995

Authors and Affiliations

  • G. M. Guisewite
    • 1
  1. 1.HRB SystemsState CollegeUSA

Personalised recommendations