Procedures for Finding Nondominated Solutions for Multiple Objective Network Programming Problems

References

  • Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows (1993) (Prentice Hall Inc., Upper Saddle River, NJ) Google Scholar
  • Barr R. S., Farhangian K., Kennington J. L. Networks with side constraints: An LU factorization update. Ann. Soc. Logist. Engineers (1986) 1:66–85Google Scholar
  • Calvete H. I., Mateo P. M. An approach for the network flow problem with multiple objectives. Comput. Oper. Res. (1995) 22(9):971–983CrossrefGoogle Scholar
  • Chen S., Saigal R. A primal algorithm for solving a capacitated network flow problem with additional linear constraints. Networks (1977) 7(1):59–79CrossrefGoogle Scholar
  • Current J., Marsh M. Multiobjective transportation network design and routing problems: Taxanomy and annotation. Eur. J. Oper. Res. (1993) 65(1):4–19CrossrefGoogle Scholar
  • Current J., Min H. Multiobjective design of transportation networks: Taxonomy and annotation. Eur. J. Oper. Res. (1986) 26(2):187–201CrossrefGoogle Scholar
  • Drinka D., Sun M., Murray B. A multiple objective embedded network model for human resource planning and an implementation of the Tchebycheff method. Decision Sci (1996) 27(2):319–341CrossrefGoogle Scholar
  • Gardiner L. R., Steuer R. E. Unified interactive multiple objective programming. Eur. J. Oper. Res. (1994) 74(3):391–406CrossrefGoogle Scholar
  • Gardiner L. R., Karney D., Klingman D., Russell R. Solving singly constrained transshipment problems. Transportation Sci (1978) 12(4):277–297LinkGoogle Scholar
  • Glover F., Klingman D. The simplex SON algorithm for LP/embedded network problems. Math. Programming Stud. (1981) 15:148–176CrossrefGoogle Scholar
  • Glover F., Klingman D. Basis exchange characterizations for the simplex SON algorithm for LP/embedded networks. Math. Programming Stud. (1985) 24:141–157CrossrefGoogle Scholar
  • Glover F., Klingman D., Phillips N. V.Network Models in Optimization and Their Applications in Practice (1992) (John Wiley and Sons Inc., New York) CrossrefGoogle Scholar
  • Kennington J. L., Helgason R. V.Algorithms for Network Programming (1980) (John Wiley and Sons Inc., New York) Google Scholar
  • Kennington J. L., Whisman A. NETSIDE user's guide. (1987) . Technical Report 86-OR-01, Department of Operations Research, SMU, Dallas, TXGoogle Scholar
  • Klingman D., Napier A., Stutz J. NETGEN—A program for generating large scale (un)capacitated assignment, transportation and minimum cost network problems. Management Sci. (1974) 20(5):814–822LinkGoogle Scholar
  • Lee H., Pulat P. S. Bicriteria network flow problems: Continuous case. Eur. J. Oper. Res. (1991) 51(1):119–126CrossrefGoogle Scholar
  • Lee H., Pulat P. S. Bicriteria network flow problems: Integer case. Eur. J. Oper. Res. (1993) 66(1):148–157CrossrefGoogle Scholar
  • Murty K. G.Network Programming (1992) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
  • Mustafa A., Goh M. Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS. Comput. Oper. Res. (1998) 25(2):139–157CrossrefGoogle Scholar
  • Ogryczak W., Studziński K., Zorychta K. A solver for the multi-objective transshipment problem with facility location. Eur. J. Oper. Res. (1989) 43(1):53–64CrossrefGoogle Scholar
  • Ogryczak W., Studziński K., Zorychta K. DINAS: A computer-assisted analysis system for multiobjective transshipment problems with facility location. Comput. Oper. Res. (1992) 19(7):637–647CrossrefGoogle Scholar
  • Pulat P. S., Huarng F., Lee H. Efficient solutions for the bicriteria network flow problem. Comput. Oper. Res. (1992) 19(7):649–655CrossrefGoogle Scholar
  • Steuer R. E.Multiple Criteria Optimization: Theory, Computation, and Application (1986) (John Wiley and Sons, Inc., New York) Google Scholar
  • Steuer R. E. User's Manual of the ADBASE Multiple Objective Programming Package. (1992) (Terry College of Business, The University of Georgia, Athens, GA) Google Scholar
  • Steuer R. E. Difficulties in solving multicriteria networks: A combined weighted sum/Tchebycheff/aspiration criterion vector interactive procedure. 12th Internat Conf. Multiple Criteria Decision Making (1995) (Hagen, Germany). Presented at theGoogle Scholar
  • Steuer R. E., Choo E.-U. An interactive weighted Tchebycheff procedure for multiple objective programming. Math. Programming (1983) 26(3):326–344CrossrefGoogle Scholar
  • Steuer R. E., Gardiner L. R. A bibliographic survey of the activities and international nature of multiple criteria decision making. J. Multi-Criteria Decision Anal (1996) 5(3):195–217CrossrefGoogle Scholar
  • Steuer R. E., Silverman J., Whisman A. W. A combined Tchebycheff/aspiration criterion vector interactive multiobjective programming procedure. Management Sci (1993) 39(10):1255–1260LinkGoogle Scholar
  • Sun M. Warm-start routines for solving multiple objective network programming problems. (2000a) . Working paper, College of Business, The University of Texas at San Antonio, San Antonio, TXGoogle Scholar
  • Sun M. Finding integer efficient solutions for multiple objective network programming problems. (2000b) . Working paper, College of Business, The University of Texas at San Antonio, San Antonio, TXGoogle Scholar
  • Sun M., Stam A., Steuer R. E. Solving multiple objective programming problems using feed-forward artificial neural networks: The interactive FFANN procedure. Management Sci (1996) 42(6):835–849LinkGoogle Scholar
  • Sun M., Stam A., Steuer R. E. Interactive multiple objective programming using Tchebycheff programs and artificial neural networks. Comput. Oper. Res. (2000) 27(7–8):601–620CrossrefGoogle Scholar
  • Wierzbicki A. P. The use of reference objectives in multiobjective optimization. Lecture Notes in Econom. Math. Syst (1980) 177(Springer-Verlag, Berlin, Germany) 468–486CrossrefGoogle Scholar
  • Wierzbicki A. P. A mathematical basis for satisficing decision making. Math. Modeling (1982) 3:391–405CrossrefGoogle Scholar
  • Yu P.-L.Multiple-Criteria Decision Making: Concepts, Techniques, and Extensions (1985) (Plenum Press, New York) CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.