A survey and annotated bibliography of multiobjective combinatorial optimization

OR Spektrum

Volumn 22, Issue 4, 2000, Pages 425-460

  Ehrgott, Matthias ^a,c   Gandibleux, Xavier ^b  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

^b UNIVERSITÉ DE VALENCIENNES   (France)

^c Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

Bibliography; Combinatorial optimization; Exact methods; Heuristics; Multicriteria optimization

Indexed keywords

EID: 0001322778     PISSN: 01716468     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002910000046     Document Type: Review

References (234)

1. Abd El-Aal RMS (1994) An interactive technique for the cutting stock problem with multiple objectives. European Journal of Operational Research 78(3):304-317
2. Ben Abdelaziz F, Chaouachi J, Krichen S (1999) A hybrid heuristic for multiobjective knapsack problems. In: Voss S, Martello S, Osman I, Roucairol C (eds) Meta-heuristics. Advances and trends in local search paradigms for optimization, pp 205-212. Kluwer, Dordrecht
3. Alves MJ, Climaco J (2000) An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search. Journal of Heuristics (in press)
4. Andersen KA, Joernsten K, Lind M (1996) On bicriterion minimal spanning trees: An approximation. Computers and Operations Research 23:1171-1182
5. Aneja YP, Nair KPK (1979) Bicriteria transportation problem. Management Science 25:73-78
6. Badri MA (1997) A two-stage multiobjective scheduling model for [faculty-course-time] assignments. European Journal of Operational Research 94(1):16-28
7. Badri MA, Davis DL, Davis DF, Hollingsworth J (1998) A multi-objective course scheduling model: combining faculty preferences for courses and times. Computers and Operations Research 25(4):303-316
8. Badri MA, Mortagy AK, Alsyed CA (1998) A multi-objective model for locating fire stations. European Journal of Operational Research 110(2):243-260
9. Beale EML (1984) Note on "A special multi-objective asignment problem" by D.J. White. Journal of the Operational Research Society 35(8):769-770
10. Bentley PJ, Wakefield JP (1996) An analysis of multiobjective optimization within genetic algorithms. The University of Huddersfield, UK, Technical Report ENGPJB96
11. Bertsekas D (1987) Dynamic programming. Prentice Hall, Englewood Cliffs, NJ
12. BoffeyB (1995) Multiobjective routing problems. Top 3(2):167-220
13. Borges PC, Hansen MP (1998) A basis for future successes in multiobjective combinatorial optimization. Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Technical Report IMM-REP-1998-8
14. Brumbaugh-Smith J, Shier D (1989) An empirical investigation of some bicriterion shortest path algorithms. European Journal of Operational Research 43(2):216-224
15. Burkard RE, Rote G, Ruhe G, Sieber N (1989) Algorithmische Untersuchungen zu bikriteriellen kostenminimalen Flüssen in Netzwerken. Wissenschaftliche Zeitung der Technischen Hochschule Leipzig 13(6):333-341
16. Calvete HI, Mateo M (1995) An approach for the network flow problem with multiple objectives. Computers and Operations Research 22(9):971-983
17. Calvete HI, Mateo M (1996) A sequential network-based approach for the multiobjective network flow problem with preemptive priorities. In: Tamiz M (ed) Multiobjective programming and goal programming - theory and applications, vol 432. Lecture Notes in Economics and Mathematical Systems, pp 74-86. Springer, Berlin Heidelberg New York
18. Camerini PM, Galbiati G, Maffioli F (1984) The complexity of multi-constrained spanning tree problems. In: Lovasz L (ed) Theory of Algorithms, Colloquium Pecs 1984, pp 53-101. North-Holland, Amsterdam
19. Carraway RL, Morin TL, Moskovitz H (1990) Generalized dynamic programming for multicriteria optimization. European Journal of Operational Research 44:95-104
20. Charnes A, Cooper WW, Niehaus RJ, Stredry A (1969) Static and dynamic assignment models with multiple objectives and some remarks on organization design. Management Science 15:365-375
21. Cho KI, Kim SH (1997) An improved interactive hybrid method for the linear multiobjective knapsack problem. Computers and Operations Research 24(11):991-1003
22. Chung S, Hamacher HW, Maffioli F, Murty KG (1993) Note on combinatorial optimization with max-linear objective functions. Discrete Applied Mathematics 42:139-145
23. Climaco J, Ferreira C, Captivo ME (1997) Multicriteria integer programming: An overview of the different algorithmic approaches. In: Climaco J (ed) Multicriteria Analysis, pp 248-258. Springer, Berlin Heidelberg New York
24. Climaco JCM, Martins EQV (1982) A bicriterion shortest path algorithm. European Journal of Operational Research 11:399-404
25. Coello CA (2000) List of references on evolutionary multiobjective optimization. http://www.lania.mx/ccoello/EMOO/EMOObib.html
26. Coello CA (1996) An empirical study of evolutionary techniques for multiobjective optimization in engineering design. PhD thesis, Department of Computer Science, Tulane University, New Orleans, LA
27. Coello CA (1998) An updated survey of GA-based multiobjective optimization techniques. Laboratorio Nacional de Informática Avanzada (LANIA), Xalapa, Veracruz, Mexico, Technical Report Lania-RD-98-08
28. Coello CA, Christiansen AD (1998) Two new GA-based methods for multiobjective optimization. Civil Engineering Systems 15(3):207-243
29. Corley HW (1985) Efficient spanning trees. Journal of Optimization Theory and Applications 45(3):481-485
30. Coutinho-Rodrigues JM, Climaco JCN, Current JR (1999) An intercative bi-objective shortest path approach: Searching for unsupported nondominated solutions. Computers and Operations Research 26(8):789-798
31. Cox RG (1984) Routing of hazardous material. PhD thesis, School of Civil and Environmental Engineering, Cornell University, Ithaca, NY
32. Current J, Marsh M (1993) Multiobjective transportation network design: Taxonomy and annotation. European Journal of Operational Research 65:4-19
33. Current J, Min H (1986) Multiobjective design of transportation networks: Taxonomy and annotation. European Journal of Operational Research 26:187-201
34. Current J, Min H, Schilling D (1990) Multiobjective analysis of facility location decisions. European Journal of Operational Research 49:295-307
35. Czyzak P, Jaszkiewicz A (1998) Pareto simulated annealing - a metaheuristic technique for multiple objective combinatorial optimization. Journal of Multi-Criteria Decision Analysis 7:34-47
36. Dahl G, Jörnsten K, Lokketangen A (1995) A tabu search approach to the channel minimization problem. Paper presented at ICOTA'95, July 5-8 1995 July, Chengdu, China
37. Das SK, Goswami A, Alam SS (1999) Multiobjective transportation problem with interval cost, source and destination parameters. European Journal of Operational Research 117:100-112
38. Daskin MS, Stren EH (1981) A hierarchical objective set covering model for emergency medical service vehicle deployment. Transportation Science 15(2):137-152
39. Dathe HM (1978) Zur Lösung des Zuordnungsproblems bei zwei Zielgrößen. Zeitschrift für Operations Research 22:105-118
40. Dell'Amico M, Maffioli F (1996) On some multicriteria arborescence problems: Complexity and algorithms. Discrete Applied Mathematics 65:191-206
41. Dell'Amico M, Maffioli F (1997) Combining linear and non-linear objectives in spanning tree problems. Technical report, Politecnico di Milano, Milan, Italy
42. Dell'Amico M, Maffioli F, Martello S (eds.) (1997) Annotated bibliographies in combinatorial optimization. Wiley, Chichester
43. Diaz JA (1978) Solving multiobjective transportation problems. Ekonomicko Mathematicky Obzor 14:267-274
44. Dutta KN, Sahu S (1982) A multigoal heuristic for facilities design problems: MUGHAL. International Journal of Production Research 20:147-154
45. Eben-Chaime M (1996) Parametric solution for linear bicriteria knapsack models. Management Science 42(11):1565-1575
46. Ehrgott M (1995) Lexicographic max-ordering - a solution concept for multicriteria combinatorial optimization. In: Schweigert D (ed) Methods of multicriteria decision theory. Proceedings of the 5th Workshop of the DGOR-Working Group Multicriteria Optimization and Decision Theory, pp 55-66, University of Kaiserslautern
47. Ehrgott M (1996) On matroids with multiple objectives. Optimization 38(1):73-84
48. Ehrgott M (1997) A characterization of lexicographic max-ordering solutions. In: Göpfert A, Seeländer J, Tammer C (eds) Methods of multicriteria decision theory, proceedings of the 6th Workshop of the DGOR-Working Group Multicriteria Optimization and Decision Theory Alexisbad 1996, vol 2389. Deutsche Hochschulschriften, pp 193-202. Hänsel-Hohenhausen, Egelsbach
49. Ehrgott M (1997) Multiple criteria optimization - classification and methodology. Shaker, Aachen
50. Ehrgott M (1998) Discrete decision problems, multiple criteria optimization classes and lexicographic max-ordering. In: Stewart TJ, van den Honert RC (eds) Trends in multicriteria decision making, vol 465. Lecture Notes in Economics and Mathematical Systems, pp 31-44. Springer, Berlin Heidelberg New York
51. Ehrgott M (1999) Integer solutions of multicriteria network flow problems. Investigacao Operacional 19:229-243
52. Ehrgott M (2000) Approximation algorithms for combinatorial multicriteria optimization problems. International Transcations in Operational Research 7:5-31
53. Ehrgott M, Hamacher HW, Klamroth K, Nickel S, Schöbel A, Wiecek MM (1997) A note on the equivalence of balance points and Pareto solutions in multiple-objective programming. Journal of Optimization Theory and Applications 92(1):209-212
54. Ehrgott M, Klamroth K (1997) Connectedness of efficient solutions in multiple criteria combinatorial optimization. European Journal of Operational Research 97:159-166
55. Ehrgott M, Klamroth K (1997) Nonconnected efficiency graphs in multiple criteria combinatorial optimization. In: Caballero R, Ruiz F, Steuer RE (eds) Advances in multiple objective and goal programming, vol 455. Lecture Notes in Economics and Mathematical Systems, pp 140-150. Springer, Berlin Heidelberg New York
56. Ehrgott M, Nickel S, Hamacher HW (1999) Geometric methods to solve max-ordering location problems. Discrete Applied Mathematics 93:3-20
57. Ehrgott M, Tenfelde D (2000) Nadir values: Computation and use in compromise programming. Technical report, University of Kaiserslautern, Department of Mathematics, Report in Wirtschaftsmathematik Nr. 60/2000. European Journal of Operational Research (submitted)
58. Emelichev VA, Perepelitsa VA (1991) Complexity of vector optimization problems on graphs. Optimization 22:903-918
59. Emelichev VA, Perepelitsa VA (1992) On cardinality of the set of alternatives in discrete many-criterion problems. Discrete Mathematics and Applications 2(5):461-471
60. Figueira J (1996) L'approche interactive dans le cas des problèmes de flot multicritères. PhD thesis, Université Paris-Dauphine, Paris, France
61. Figueira J, Captivo ME, Climaco J (1997) Sur le problème des chemins bi-critères: Une approche interactive a posteriori. Technical Report 149, LAMSADE, Université de Paris Dauphine.
62. Figueira J, M'Silti H, Tolla P (1998) Using mathematical programming heuristics in a multicriteria network flow context. Journal of the Operational Research Society 49:878-885
63. Fischer R, Richter K (1982) Solving a multiobjective traveling salesman problem by dynamic programming. Mathematische Operationsforschung und Statistik, Series Optimization 13(2):247-252
64. Fonseca CM, Fleming PJ (1993) Genetic algorithms for multiobjective optimization: Formulation, discussion and generalization. In: Forrest S (ed) Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, California, University of Illinois at Urbana-Champaign, pp 416-423. Morgan Kauffman, San Francisco, CA
65. Fortenberry JC, Cox JF (1985) Multicriteria approach to the facilities layout problem. International Journal of Production Research 23:773-782
66. Fruhwirth B, Burkard RE, Rote G (1989) Approximation of convex curves with application to the bicriterial minimum cost flow problem. European Journal of Operational Research 42:326-388
67. Gabrel V, Vanderpooten D (1996) Generation and selection of efficient paths in a multiple criteria graph: The case of daily planning the shots taken by a satellite with an interactive procedure. Technical Report 136, LAMSADE, Université Paris Dauphine
68. Gallagher RJ, Saleh OA (1994) Constructing the set of efficient objective values in linear multiple objective transportation problems. European Journal of Operational Research 73:150-163
69. Gandibleux X, Fréville A (2000) Tabu search based procedure for solving the 0/1 multiobjective knapsack problem: The two objective case. Journal of Heuristics (in press)
70. Gandibleux X, Mezdaoui N, Fréville A (1997) A tabu search procedure to solve multiobjective combinatorial optimization problems. In: Caballero R, Ruiz F, Steuer R (eds) Advances in multiple objective and goal programming, vol 455. Lecture Notes in Economics and Mathematical Systems, pp 291-300. Springer, Berlin Heidelberg New York
71. Gandibleux X, Mezdaoui N, Ulungu EL (1997) Evaluation of multiobjective tabu search procedure on a multiobjective permutation problem. Paper presented at ORBEL 11, Namur (Belgium)
72. Gandibleux X, Morita H, Katoh N (1998) A genetic algorithm for 0-1 multiobjective knapsack problem. Technical report, University of Valenciennes, France. Paper presented at NACA98, Niigata, Japan
73. Gandibleux X, Vancoppenolle D, Tuyttens D (1998) A first making use of GRASP for solving MOCO problem. Technical report, University of Valenciennes, France, Paper presented at MCDM 14, Charlottesville, VA
74. Garey MR, Johnson DS (1979) Computers and intractability - A guide to the theory of NP-completeness. Freeman, San Francisco, CA
75. Gen M, Li YZ (1998) Solving multi-objective transportation problems by spanning tree-based genetic algorithm. In: The Integration of evolutionary and adaptive computing technologies with product/system design and realisation, pp 95-108. Springer, Berlin Heidelberg New York
76. Gen M, Li YZ (1998) Spanning tree based genetic algorithm forbicriteria transportation problem. Computers and Industrial Engineering 35(3/4):531-534
77. Geoffrion AM (1968) Proper efficiency and the theory of vector maximization. Journal of Mathematical Analysis and Applications 22:618-630
78. Glover F, Laguna M (1997) Tabu search. Kluwer, Dordrecht
79. Godard JM (1998) Simulated annealing for multiobjective travel organization problems. Technical report, University of Mons-Hainaut, Belgium, Paper presented at EURO XVI, Brussels, Belgium
80. Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading, MA
81. Granot D (1984) A new exchange property for matroids and its application to max-min problems. Zeitschrift für Operations Research 28:41-45
82. Hamacher HW (1982) Determining minimal cuts with a minimal number of arcs. Networks 12:493-504
83. Hamacher HW (1995) K best network flows. Annals of Operations Research 57:65-72 (special volume) Industrial systems
84. Hamacher HW, Labbé M, Nickel S (1999) Multicriteria network location problems with sum objectives. Networks 33:79-92
85. Hamacher HW, Ruhe G (1994) On spanning tree problems with multiple objectives. Annals of Operations Research 52:209-230
86. Hanne T (1999) On the convergence of multiobjective evolutionary algorithms. European Journal of Operational Research 117:553-564
87. Hanne T (2000) Global multiobjective optimization using evolutionary algorithms. Journal of Heuristics (in press)
88. Hansen MP (1997) Solving multiobjective knapsack problems using MOTS. Technical report, Institute of Mathematical Modelling, Technical University of Denmark. Paper presented at MIC 97, Sophia Antipolis, France
89. Hansen MP (1997) Tabu search for multiobjective optimization: MOTS. Technical report, Technical University of Denmark, Paper presented at MCDM 13, Cape Town, South Africa
90. Hansen MP (1998) Metaheuristics for multiple objective combinatorial optimization. PhD thesis, Institute of Mathematical Modelling, Technical University of Denmark. Lyngby, Denmark, Report IMM-PHD-1998-45
91. Hansen MP (2000) Use of substitute scalarizing functions to guide a local search based heuristics: The case of moTSP. Journal of Heuristics (in press)
92. Hansen MP, Jaszkiewiecz A (1998) Evaluating the quality of approximatios to the non-dominated set. Technical report, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Technical Report IMM-REP-1998-7
93. Hansen P (1979) Bicriterion path problems. In: Fandel G, Gal T (eds) Multiple criteria decision making theory and application, vol 177. Lecture Notes in Economics and Mathematical Systems, pp 109-127. Springer, Berlin Heidelberg New York
94. Hapke M, Jaszkiewicz A, Slowinski R (1998) Interactive analysis of multiple-criteria project scheduling problems. European Journal of Operational Research 107:315-324
95. Hapke M, Jaszkiewicz A, Slowinski R (2000) Pareto simulated annealing for fuzzy multi-objective combinatorial optimization. Journal of Heuristics (in press)
96. Harnett RM, Ignizio JP (1973) A heuristic program for the covering problem with multiple objectives. In: Cochrane JL, Zeleny M (eds) Multiple criteria decision making, pp 738-740. University of South Carolina Press, Columbia, SC
97. Hartley R (1985) Vector optimal routing by dynamic programming. In: Serafini P (ed) Mathematics of multiobjective optimization, vol 289. CISM International Centre for Mechanical Sciences - Courses and Lectures, pp 215-224. Springer, Wien
98. Henig MI (1985) The shortest path problem with two objective functions. European Journal of Operational Research 25:281-291
99. Henig MI (1994) Efficient interactive methods for a class of multiattribute shortest path problems. Management Science 40(7):891-897
100. Hertz A, Jaumard B, Ribeiro C, Formosinho Filho W (1994) A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives. RAIRO - Recherche Opérationnelle/Operations Research 28(3):303-328
101. Hodgson MJ, Rosing KE, Storrier ALG (1997) Testing abicriterion location-allocation model with real-world network traffic: The case of Edmonton, Canada. In: Climaco J (ed) Multicriteria analysis, pp 484-495. Springer, Berlin Heidelberg New York
102. Hong SC, Park YB (1999) A heuristic for bi-objective vehicle routing with time window constraints. International Journal of Production Economics 62:249-258
103. Hoogeveen JA (1992) Single-machine bicriteria scheduling. PhD thesis, Technische Universiteit Eindhoven, The Netherlands
104. Horn J, Nafpliotis N, Goldberg DE (1994) A niched Pareto genetic algorithm for multiobjective optimization. In: Proceedings of the First IEEE Conference on Evolutionary Computation IEEE World Congress on Computational Intelligence, Piscataway, NJ, vol 1, pp 82-87. IEEE Service Center
105. Huarng F, Pulat PS, Shih LS (1996) A computational comparison of some bicriterion shortest path algorithms. Journal of the Chinese Institute of Industrial Engineers 13(2):121-125
106. Ignizio JP (1976) Goal programming and extensions. Lexington Books, Lexington, KY
107. Isermann H (1974) Proper efficiency and the linear vector maximum problem. Operations Research 22:189-191
108. Isermann H (1979) The enumeration of all efficient solutions for a linear multiple-objective transportation problem. Naval Research Logistics Quarterly 26:123-39
109. Jacobs FR (1987) A layout planning system with multiple criteria and a variable domain representation. Management Science 33(8):1020-1034
110. Jaszkiewicz A (1998) Genetic local search for multiple objective combinatorial optimization. Technical report, Institute of Computing Science; Poznan University of Technology, Poland, working paper RA-014/98
111. Joernsten K, Lind M (1994) On bicriterion minimum spanning trees. Technical report, Department of Operations Research, University of Aarhus, Denmark
112. Jones D, Tamiz M (1998) Investigation into the incorporation and use of multiple objectives in genetic algorithms. Paper presented at MCDM 14, Charlottesville, VA
113. Kalu TCU (1999) Capital budgeting under uncertainty: An extended goal programming approach. International Journal of Production Research 58(3):235-251
114. Klamroth K, Wiecek M (1998) Dynamic programming approaches to the multiple criteria knapsack problem. Clemson University, Technical Report No. 666. Naval Research Logistics (to appear)
115. Klamroth K, Wiecek M (1998) Time-dependent capital budgeting with multiple criteria. Clemson University, Technical Report No. 663. Proceedings of the 14th International Conference on Multiple Criteria Decision Making (to appear)
116. Klamroth K, Wiecek M (1998) A time-dependent multiple criteria knapsack problem. Clemson University, Technical Report No. 664. Journal of Mathematical Analysis and Applications (submitted)
117. Klingman D, Mote J (1982) Solution approaches for network flow problems with multiple criteria. Advances in Management Studies 1(1):1-30
118. Köksalan M, Azizoglu M, Kondakci SK (1995) Heuristics to minimize flowtime and maximum earliness on a single machine. Technical report, Krannert School of Management, Purdue University, CMME working paper Series No. 95-10-1
119. Korhonen P, Salo S, Steuer RE (1997) A heuristic for estimating Nadir criterion values in multiple objective linear programming. Operations Research 45(5):751-757
120. Kostreva MM, Wiecek MM (1993) Time dependency in multiple objective dynamic programming. Journal of Mathematical Analysis and Applications 173(1):289-307
121. Kouvelis P, Carlson RC (1992) Total unimodularity applications in bi-objective discrete optimization. Operations Research Letters 11:61-65
122. Krause M, Nissen V (1995) On using penalty functions and multicriteria optimisation techniques in facility layout. In: Biethahn J (ed) Evolutionary algorithms in management applications, pp 153-166. Springer, Berlin Heidelberg New York
123. Kung HT, Luccio F, Preparata FP (1975) On finding the maxima of a set of vectors. Journal of the Association for Computing Machinery 22(4):469-476
124. Labbé M (1997) Location problems. In: Dell'Amico M, Maffioli F, Martello S (eds) Annotated bibliographies in combinatorial optimization, pp 261-281. Wiley, Chichester
125. Labbé M, Peeters D, Thisse JF (1995) Location on networks. In: Network routing, vol 8. Handbooks in OR & MS, pp 551-624. Elsevier, Amsterdam
126. Lee H (1991) Integer solutions of bicriteria network flow problems. PhD thesis, University of Oklahoma, Norman, OK
127. Lee H, Pulat PS (1991) Bicriteria network flow problems: Continuous case. European Journal of Operational Research 51:119-126
128. Lee H, Pulat PS (1993) Bicriteria network flow problems: Integer case. European Journal of Operational Research 66:148-157
129. Lee SM (1972) Goal Programming for decision analysis. Auerbach, Philadelphia, PA
130. Li L, Lai KK (2000) A fuzzy approach to the multiobjective transportation problem. Computers and Operations Research 27:43-57
131. Lind M (1996) Cooperative game theory and multiple criteria decision making. PhD thesis, Department of Operations Research, University of Aarhus, Denmark
132. Malakooti B (1989) Multiple objective facility layout: A heuristic to generate efficient alternatives. International Journal of Production Research 27:1225-1238
133. Malakooti B, D'Souza GI (1987) Multiple objective programmig for the quadratic assignment problem. International Journal of Production Research 25:285-300
134. Malakooti B, Wang J, Tandler EC (1990) A sensor-based accelerated approach for multi-attribute machinability and tool life evaluation. International Journal of Production Research 28:2373
135. Malczewski J, Ogryczak W (1995) The multiple criteria location problem: 1. A generalized network model and the set of efficient solutions. Environment and Planning A 27:1931-1960
136. Malczewski J, Ogryczak W (1996) The multiple criteria location problem: 2. Preference-based techniques and interactive decision support. Environment and Planning A 28:69-98
137. Malhotra R, Puri MC (1984) Bi-criteria network problem. Cahiers du Centre d'Etudes Recherche Operationelle 26(1/2):95-102
138. MarettR, Wright M (1996) A comparison of neighborhood search techniques for multiobjective combinatorial problems. Computers and Operations Research 23(5):465-483
139. Martins EQV (1984) On a multicriteria shortest path problem. European Journal of Operational Research 16:236-245
140. Martins EQV (1996) Bibliography of papers on multiobjective optimal path problems. www.mat.uc.pt/eqvm/Bibliografias.html
141. Martins EQV, Climaco JCN (1981) On the determination of the nondominated paths in a multiobjective network problem. Methods of Operations Research 40:255-258
142. Martins EQV, Santos JLE (1997) An algorithm for the quickest path problem. Operations Research Letters 20(4):195-198
143. Minoux M (1989) Solving combinatorial problems with combined min-max-min-sum objective and applications. Mathematical Programming 45:361-372
144. Modesti P, Sciomachen A (1998) A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks. European Journal of Operational Research 111(3):495-508
145. Mote J, Murthy I, Olson DL (1991) A parametric approach to solving bicriterion shortest path problems. European Journal of Operational Research 53:81-92
146. Murata T, Ishibuchi H (1995) MOGA: Multi-objective genetic algorithms. In: Proceedings of the 2nd IEEE International Conference on Evolutionary Computing, Perth, Australia, pp 289-294
147. Murthy I, Her SS (1992) Solving min-max shortest-path problems on a network. Naval Research Logistics 39:669-683
148. Murthy I, Olson D (1994) An interactive procedure using domination cones for bicriterion shortest path problems. European Journal of Operational Research 72(2):418-432
149. Mustafa A, Goh M (1996) Assigning faculty to courses: A multiple objective approach using DINAS. In: Lee HG, Tam KY (eds) Proceedings of the First Asia-Pacific Decision Sciences Institute Conference, pp 671-680
150. Mustafa A, Goh M (1997) Characteristics of the efficient solutions of bicriteria and tricriteria network flow problems. In: Caballero R, Ruiz F, Steuer RE (eds) Advances in multiple objective and goal programming, vol 455. Lecture Notes in Economics and Mathematical Systems, pp 131-139. Springer, Berlin Heidelberg New York
151. Mustafa A, Goh M (1998) Finding integer efficient solutions for bicriteria and tricriteria network flow problems. Computers and Operations Research 25(2):139-157
152. Neumayer P (1994) Complexity of optimization on vectorweighted graphs. In: Bachem A, Derigs U, Jünger M, Schrader R (eds) Operations research, vol 93, pp 359-361. Physica, Heidelberg
153. Ogryczak W (1994) Location problems from the multiple criteria perspective: Efficient solutions. Technical Report 94-019, Université Libre de Bruxelles, Belgium
154. Ogryczak W (1997) On the lexicographic minimax approach to location problems. European Journal of Operational Research 100:566-585
155. Osman I, Laporte G (1996) Metaheuristics: A bibliography. Annals of Operations Research 63:513-623
156. Pelegrin B, Fernandez P (1998) On the sum-max bicriterion path problem. Computers and Operations Research 25(12):1043-1054
157. Prasad SY (1998) Approximation error analysis in bicriteria heuristics. Journal of Multi-Criteria Decision Analysis 7(3):155-159
158. Pulat PS, Huarng F, Lee H (1992) Efficient solutions for the bicriteria network flow problem. Computers and Operations Research 19(7):649-655
159. Punnen AP (1994) On combined minmax-minsum optimization. Computers and Operations Research 21(6):707-716
160. Punnen AP, Aneja YP (1995) Minmax combinatorial optimization. European Journal of Operational Research 81:634-643
161. Punnen AP, Nair KPK (1996) An O(m log n) algorithm for the max + sum spanning tree problem. European Journal of Operational Research 89:423-426
162. Bhatia HL, Malhotra R, Puri MC (1982) Bi-criteria assignment problem. Operations Research 19(2):84-96
163. Rajendra Prasad V, Nair NPK, Aneja YP (1993) A generalized time-cost trade-off transportation problem. Journal of the Operational Research Society 44:1243-1248
164. Ramos RM, Alonso S, Sicilia J, Gonzalez C (1998) The problem of the optimal biobjective spanning tree. European Journal of Operational Research 111:617-628
165. Rana K, Vickson RG (1988) A model and solution algorithm for optimal routing of a time-chartered containership. Transportation Science 22:83-96
166. Rasmussen LM (1986) Zero-one programming with multiple criteria. European Journal of Operational Research 26:83-95
167. Reeves C (1995) Modern heuristic techniques for combinatorial problems. Advanced topics in computer science. McGrawHill, London
168. ReVelle C, Cohon JL, Shobys D (1981) Multiple objectives in facility location: A review. In: Organizations: multiple agents with multiple criteria, vol 190. Lecture Notes in Economics and Mathematical Systems, pp 321-327. Springer, Berlin Heidelberg New York
169. Ringuest J, Rinks D (1987) Interactive solutions for the linear multi-objective transportation problem. European Journal of Operational Research 32(1):96-106
170. Rosenblatt MJ (1979) The facilities layout problem: A multi-goal aproach. International Journal of Production Research 17:323-332
171. Rosenblatt MJ, Sinuany-Stern Z (1989) Generating the discrete efficient frontier to the capital budgeting problem. Operations Research 37(3):384-394
172. Ruhe G (1988) Complexity results for multicriteria and parametric network flows using a pathological graph of Zadeh. Zeitschrift für Operations Research 32:59-27
173. Ruhe G, Fruhwirth B (1990) ∈-optimality for bicriteria programs and its application to minimum cost flows. Computing 44(1):21-34
174. Safer HM (1992) Fast approximation schemes for multi-criteria combinatorial optimization. PhD thesis, Sloan School of Management, MTT, Cambridge, MA
175. Safer HM, Orlin JB (1995) Fast approximation schemes for multi-criteria combinatorial optimization. Technical report, Sloan School of Management, MIT, Cambridge, MA, working paper 3756-95
176. Safer HM, Orlin JB (1995) Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems. Technical report, Sloan School of Management, MIT, Cambridge, MA, working paper 3757-95
177. Salman FS, Kalagnanam J, Murthy S (1999) Cooperative strategies for solving the bicriteria sparse multiple knapsack problem. Technical report, GSIA, Carnegie Mellon University, Pittsburgh, PA, presented at Congress on Evolutionary Computation -CEC99, July 6-9 1999, Washington, DC
178. Sawaragi Y, Nakayama H, Tanino T (1985) Theory of multiobjective optimization. Academic Press, Orlando, FL
179. Saxena RR, Arora SR (1995) Enumeration technique for solving the multi-objective linear set covering problem. Asia-Pacific Journal of Operational Research 12:87-97
180. Sayin S (1997) Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Technical Report No 1997/25, Koç University, Paper presented at MCDM 14, Charlottesville, VA
181. Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Proceedings of the first International Conference on Genetic Algorithms and their Applications, pp 93-100. Lawrence Erlbaum, Pittsburgh, PA
182. Schweigert D (1990) Linear extensions and efficient trees. Preprint 172, University of Kaiserslautern, Department of Mathematics
183. Schweigert D (1990) Linear extensions and vector-valued spanning trees. Methods of Operations Research 60:219-222
184. Schweigert D (1995) Vector-weighted matchings. In: Colbourn CJ, Mahmoodian ES (eds) Combinatorics advances, vol 329. Mathematics and its applications, pp 267-276. Kluwer, Dordrecht
185. Sedeno-Noda A, Gonzalez-Martin C (1999) An algorithm for the biobjective integer minimum cost flow problem. Computers and Operations Research (in press)
186. Serafini P (1986) Some considerations about computational complexity for multi objective combinatorial problems. In: Jahn J, Krabs W (eds) Recent advances and historical development of vector optimization, vol 294. Lecture Notes in Economics and Mathematical Systems. Springer, Berlin Heidelberg New York
187. Serafini P (1992) Simulated annealing for multiobjective optimization problems. In: Proceedings of the 10th International Conference on Multiple Criteria Decision Making, Taipei-Taiwan, vol I, pp 87-96
188. Sergienko IV, Perepelitsa VA (1991) Finding the set of alternatives in discrete multicriterion problems. Cybernetics 27(3):673-683
189. Shang JS (1993) Multicriteria facility layout problem: An integrated approach. European Journal of Operational Research 66(3):291-304
190. Shi Y (1995) A transportation model with multiple criteria and multiple constraint levels. Mathematical Computer Modelling 21(4):13-28
191. Sinuany-Stern Z, Weiner I (1994) The one dimensional cutting stock problem using two objectives. Journal of the Operational Research Society 45(2):231-236
192. Skriver AJV, Andersen KA (1998) A label correcting approach for solving bicriterin shortest path problems. Technical report, Department of Operations Research, University of Aarhus, Denmark. Computers and Operations Research (to appear)
193. Srinivas N, Kalyanmoy D (1994) Multiobjective optimization using non-dominated sorting in genetic algorithms. Evolutionary Computation 2(3):221-248
194. Srinivasan V, Thompson GL (1976) Algorithms for minimizing total cost, bottleneck time and bottleneck shipment in transportation problems. Naval Research Logistics Quarterly 23:567-595
195. Steuer RE, Gardiner LR, Gray J (1996) A bibliographic survey of the activities and international nature of multiple criteria decision making. Journal of Multi-Criteria Decision Analysis 5:195-217
196. Sun M, Stam A, Steuer R (1996) Solving multiple objective programming problems using feed-forward artificial neural networks: The interactive FFANN procedure. Management Science 42(6):835-849
197. Sysoev V, Dolgui A (1999) A Pareto optimization approach for manufacturing system design. In: Proceedings of the IEPM99 International Conference, Glasgow, Scotland, vol 2, pp 116-125
198. Teghem J, Kunsch PL (1986) Interactive methods for multi-objective integer linear programs. In: Fandel G, Grauer M, Kurzhanski A, Wierzbicki AP (eds) Large-scale modelling and interactive decision analysis, vol 273. Lecture Notes in Economics and Mathematical Systems, pp 75-87. Springer, Berlin Heidelberg New York
199. Teghem J, Kunsch PL (1986) A survey of techniques for finding efficient solutions to multi-objective integer linear programming. Asia-Pacific Journal of Operational Research 3:95-108
200. Teghem J, Tuyttens D, Ulungu EL (1998) An interactive heuristic method for multiobjective combinatorial optimization. Technical report, Faculté Polytechnique de Mons, Belgium
201. Thizy JM, Pissarides S, Rawat S, Lane DE (1996) Interactive multiple criteria optimization for capital budgeting in a canadian telecommunications company. In: Tamiz M (ed) Multi-objective programming and goal programming - theories and applications, vol 432. Lecture Notes in Economics and Mathematical Systems, pp 128-147. Springer, Berlin Heidelberg New York
202. T'Kindt V (1999) Etude des problèmes d'ordonnancement multicritères. PhD thesis, E3I, Université Francois Rabelais, Tours, France
203. T'Kindt V, Billaut JC (1999) Multicriteria scheduling problems: A survey. Technical report, E3I - Université Francois Rabelais Tours, France, in RAIRO (to appear)
204. T'Kindt V, Billaut JC (1999) Some guidelines to solve multicriteria scheduling problems. In: IEEE systems, man and cybernetics conference proceedings, Tokyo, Japan
205. Tung CT (1994) A multicriteria Pareto-optimal algorithm for the traveling salesman problem. Asia-Pacific Journal of Operational Research 11:103-115
206. Tung CT, Chew KL (1988) A bicritrion Pareto-optimal path algorithm. Asia-Pacific Journal of Operational Research 5:166-172
207. Tung CT, Chew KL (1992) A multicriteria Pareto-optimal path algorithm. European Journal of Operational Research 62:203-209
208. Tuyttens D, Teghem J, Fortemps P, Van Nieuwenhuyse K (2000) Performance of the MOSA method for the bicriteria assignment problem. Journal of Heuristics (in press)
209. Tzeng GH, Teodorovic D, Hwang MJ (1996) Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower. European Journal of Operational Research 95(1):62-72
210. Ulungu B, Teghem J, Ost C (1998) Efficiency of interactive multi-objective simulated annealing through a case study. Journal of the Operational Research Society 49:1044-1050
211. Ulungu EL (1993) Optimisation combinatoire multicritere: determination de l'ensemble des solutions efficaces et methodes interactives. PhD thesis, Faculté des Sciences, Université de Mons-Hainaut, Mons, Belgium
212. Ulungu EL, Teghem J (1991) Multi-objective shortest path problem: A survey. In: Glückaufova D, Loula D (eds) Proceedings of the International Workshop on Multicriteria Decision Making: Methods - Algorithms - Applications at Liblice, Czechoslovakia, pp 176-188
213. Ulungu EL, Teghem J (1992) Multicriteria assignment problem - a new method. Technical report, Faculté Polytechnique de Mons, Belgium
214. Ulungu EL, Teghem J (1994) Application of the two phases method to solve the bi-objective knapsack problem. Technical report, Faculté Polytechnique de Mons, Belgium
215. Ulungu EL, Teghem J (1994) Multi-objective combinatorial optimization problems: A survey. Journal of Multi-Criteria Decision Analysis 3:83-104
216. Ulungu EL, Teghem J (1994) The two-phases method: An efficient procedure to solve bi-objective combinatorial optimization problems. Foundations of Computing and De-cision Sciences 20(2):149-165
217. Ulungu EL, Teghem J (1997) Solving multi-objective knapsack problem by a branch-and-bound procedure. In: Climaco J (ed) Multicriteria analysis, pp 269-278. Springer, Berlin Heidelberg New York
218. Ulungu EL, Teghem J, Fortemps P (1995) Heuristics for multi-objective combinatorial optimisation problem by simulated annealing. In: Wei Q, Gu J, Chen G, Wang S (eds) MCDM: Theory and applications, pp 228-238. SCI-TECH Information services
219. Ulungu EL, Teghem J, P Fortemps, Tuyttens D (1999) MOSA method: A tool for solving multi-objective combinatorial optimization problems. Journal of Multi-Criteria Decision Analysis 8(4):221-236
220. Urban TL (1987) A multiple criteria model for the facilities layout problem. International Journal of Production Research 25:1805-1812
221. Valiant LG, Vazirani W (1986) NP is as easy as detecting unique solutions. Theoretical Computer Science 47:85-93
222. Visée M, Teghem J, Pirlot M, Ulungu EL (1998) Two-phases method and branch and bound procedures to solve the bi-obective knapsack problem. Journal of Global Optimization 12:139-155
223. Warburton A (1985) Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems. Mathematical Programming 33:234-241
224. Warburton A (1987) Aproximation of Pareto optima in multiple-objective shortest-path problems. Operations Research 35(1):70-79
225. Wäscher G (1984) Innerbetriebliche Standortplanung. Schmalenbach's Zeitschrift für betriebswirtscahftliche Forschung 36:930-958
226. White DJ (1984) A special multi-objective asignment problem. Journal of the Operational Research Society 35(8):759-767
227. White DJ (1987) The set of efficient solutions for multiple objective shortest path problems. Computers and Operations Research 9(2):101-107
228. White DJ (1990) A bibliography on the application of mathematical programming multiple-objective methods. Journal of the Operational Research Society 41(8):669-691
229. Yang XQ, Goh CJ (1997) A method for convex curve approximation. European Journal of Operational Research 97:205-212
230. Yu PL (1985) Multiple criteria decision making: concepts, techniques and extensions. Plenum Press, New York, NY
231. Zhou G, Gen M (1999) Genetic algorithm approach on multi-criteria minimum spanning tree problem. European Journal of Operational Research 114:141-152
232. Zimmermann U (1980) Matroid intersection problems with generalized objectives. In: Prékopa A (ed) Survey of mathematical programming. Proceedings of the 9th International Mathematical Programming Symposium Budapest 1976, vol 2, pp 383-392. North-Holland, Amsterdam
233. Zimmermann U (1981) Linear and combinatorial optimization in ordered algebraic structures, Number 10. Annals of Discrete Mathematics. North-Holland, Amsterdam
234. Zionts S (1979) A survey of multiple criteria integer programming methods. Annals of Discrete Mathematics 5:389-398