Multiobjective Combinatorial Optimization — Theory, Methodology, and Applications
暂无分享,去创建一个
[1] R. Bellman. Dynamic programming. , 1957, Science.
[2] A. M. Geoffrion. Proper efficiency and the theory of vector maximization , 1968 .
[3] A. Charnes,et al. Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design , 1969 .
[4] D. H. Marks,et al. An Analysis of Private and Public Sector Location Models , 1970 .
[5] Edward R. Clayton,et al. A Goal Programming Model for Academic Resource Allocation , 1972 .
[6] Sang M. Lee,et al. Goal programming for decision analysis , 1972 .
[7] Laurence J. Moore,et al. Optimizing Transportation Problems with Multiple Objectives , 1973 .
[8] G. Thompson,et al. Alternate Formulations for Static Multi-Attribute Assignment Models , 1973 .
[9] Heinz Isermann,et al. Technical Note - Proper Efficiency and the Linear Vector Maximum Problem , 1974, Oper. Res..
[10] H. T. Kung,et al. On Finding the Maxima of a Set of Vectors , 1975, JACM.
[11] Roger M. Y. Ho,et al. Goal programming and extensions , 1976 .
[12] K. Lawrence,et al. A multiple goal linear programming model for coordinated production and logistics planning , 1976 .
[13] Moshe Asher Pollatscheck. Personnel assignment by multiobjective programming , 1976, Math. Methods Oper. Res..
[14] Gerald L. Thompson,et al. ALGORITHMS FOR MINIMIZING TOTAL COST, BOTTLENECK TIME AND BOTTLENECK SHIPMENT IN TRANSPORTATION PROBLEMS , 1976 .
[15] Nancy L. Nihan,et al. A PLANNING MODEL FOR MULTIPLE-MODE TRANSPORTATION SYSTEM OPERATIONS , 1976 .
[16] Sang M. Lee,et al. Multi-Criteria School Busing Models , 1977 .
[17] Gerald L. Thompson,et al. Determining Cost vs. Time Pareto-Optimal Frontiers in Multi-Modal Transportation Problems , 1977 .
[18] Bernard W. Taylor,et al. Analysis of a transshipment problem with multiple conflicting objectives , 1978, Comput. Oper. Res..
[19] Edward L. Hannan. Allocation of library funds for books and standing orders - a multiple objective formulation , 1978, Comput. Oper. Res..
[20] Hans M. Dathe,et al. Zur Lösung des Zuordnungsproblems bei zwei Zielgrößen , 1978, Z. Oper. Research.
[21] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[22] David J. Thuente,et al. TWO ALGORITHMS FOR SHORTEST PATHS THROUGH MULTIPLE CRITERIA NETWORKS , 1979 .
[23] D. Klingman,et al. Solution Approaches for Network Flow Problems with Multiple Criteria , 1979 .
[24] R. Dial. A MODEL AND ALGORITHM FOR MULTICRITERIA ROUTE-MODE CHOICE , 1979 .
[25] Ahmed K. Rifai,et al. Goal programming application to assignment problem in marketing , 1979 .
[26] T. Stewart,et al. Two-Stage Optimization in a Transportation Problem , 1979 .
[27] N. K. Kwak,et al. A goal programming model for improved transportation problem solutions , 1979 .
[28] Meir J. Rosenblatt,et al. The facilities layout problem: a multi-goal approach , 1979 .
[29] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..
[30] Y. Aneja,et al. BICRITERIA TRANSPORTATION PROBLEM , 1979 .
[31] K. Bhaskar. A Multiple Objective Approach to Capital Budgeting , 1979 .
[32] H. Isermann. The enumeration of all efficient solutions for a linear multiple-objective transportation problem , 1979 .
[33] S. Zionts. A Survey of Multiple Criteria Integer Programming Methods , 1979 .
[34] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..
[35] H. G. Daellenbach,et al. Note on Multiple Objective Dynamic Programming , 1980 .
[36] Pierre Hansen,et al. Bicriterion Path Problems , 1980 .
[37] David N. Ricchiute,et al. A goal programming model for achieving racial balance in public schools , 1980 .
[38] Richard Weber,et al. On the interactive solution to a multicriteria scheduling problem , 1980, Z. Oper. Research.
[39] Ludo Gelders,et al. Solving a bicriterion scheduling problem , 1980 .
[40] Marc Los,et al. Combinatorial Programming, Statistical Optimization and the Optimal Transportation Network Problem , 1980 .
[41] Richard M. Soland,et al. A multicriteria approach to the location of public facilities , 1980 .
[42] Richard M. Soland,et al. An interactive computer system for multicriteria facility location , 1981, Comput. Oper. Res..
[43] D. Halder,et al. A METHOD FOR SELECTING OPTIMUM NUMBER OF STATIONS FOR A RAPID TRANSIT LINE : AN APPLICATION IN CALCUTTA TUBE RAIL , 1981 .
[44] Terry L. Friesz. Multiobjective Optimization in Transportation: The Case of Equilibrium Network Design , 1981 .
[45] J. Cohon,et al. Multiple Objectives in Facility Location: A Review , 1981 .
[46] Chang S. Kim,et al. A Multicriteria Warehouse Location Model , 1981 .
[47] Jeffrey L. Arthur,et al. A Multiple Objective Nurse Scheduling Model , 1981 .
[48] Mark S. Daskin,et al. A Hierarchical Objective Set Covering Model for Emergency Medical Service Vehicle Deployment , 1981 .
[49] Sang M. Lee,et al. A multiple criteria model for the location-allocation problem , 1981, Comput. Oper. Res..
[50] Horst W. Hamacher,et al. Determining minimal cuts with a minimal number of arcs , 1982, Networks.
[51] Marc J. Schniederjans,et al. An Application of Goal Programming to Resolve a Site Location Problem , 1982 .
[52] E. Martins,et al. A bicriterion shortest path algorithm , 1982 .
[53] D. J. White,et al. The set of efficient solutions for multiple objective shortest path problems , 1982, Comput. Oper. Res..
[54] Jeffrey L. ArthurKenneth D. Lawrence,et al. Multiple goal production and logistics planning in a chemical and pharmaceutical company , 1982, Comput. Oper. Res..
[55] S. Sahu,et al. A multigoal heuristic for facilities design problems: MUGHAL , 1982 .
[56] Samuel Eilon. Multi‐Criteria Warehouse Location , 1982 .
[57] L. Bittner,et al. Effiziente, optimale effiziente wege in graphen and diskret-differentielle prozesse mit vektorwertigem funktional , 1982 .
[58] James P. Ignizio,et al. A Multicriteria Approach to Supersystem Architecture Definition , 1982, IEEE Transactions on Computers.
[59] Knut Richter,et al. Solving a multiobjective traveling salesman problem by dynamic programming , 1982 .
[60] P. Harker,et al. Multi-Objective Design of Transportation Networks: The Case of Spatial Price Equilibrium , 1983 .
[61] Lamberto Cesari,et al. Optimization-Theory And Applications , 1983 .
[62] J. Ignizio. An approach to the modeling and analysis of multiobjective generalized networks , 1983 .
[63] Samuel J. Ratick,et al. A mixed integer and multiple objective programming model to analyze coal handling in New England , 1983 .
[64] S. Ratick. Multiobjective programming with related bargaining games An application to utility coal conversions , 1983 .
[65] P. Harker,et al. MULTICRITERIA SPATIAL PRICE EQUILIBRIUM NETWORK DESIGN: THEORY AND COMPUTATIONAL RESULTS , 1983 .
[66] Richard M. Soland,et al. The design of multiactivity multifacility systems , 1983 .
[67] Stelios H. Zanakis. A staff to job assignment (partitioning) problem with multiple objectives , 1983, Comput. Oper. Res..
[68] Marc J. Schniederjans,et al. A Multicriteria Assignment Problem: A Goal Programming Approach , 1983 .
[69] Philippe Vincke. Problèmes de localisation multicritères , 1983 .
[70] W. Habenicht,et al. Quad Trees, a Datastructure for Discrete Vector Optimization Problems , 1983 .
[71] Yacov Y. Haimes,et al. Multiobjective Decision Making: Theory and Methodology , 1983 .
[72] E. M. L. Beale. Note on “A Special Multi-Objective Assignment Problem” by D. J. White , 1984 .
[73] M. C. Puri,et al. Bi-criteria network problem , 1984 .
[74] D. J. White,et al. A Special Multi-Objective Assignment Problem , 1984 .
[75] F. Szidarovszky,et al. Multiobjective management of mining under water hazard by game theory , 1984 .
[76] Charles Sutcliffe,et al. Goal Programming and Allocating Children to Secondary Schools in Reading , 1984 .
[77] Sheila M. Lawrence,et al. A Multiple objective shift allocation model , 1984 .
[78] D. Klingman,et al. Topological and Computational Aspects of Preemptive Multicriteria Military Personnel Assignment Problems , 1984 .
[79] Daniel Granot. A new exchange property for matroids and its application to max-min-problems , 1984, Z. Oper. Research.
[80] Charles ReVelle,et al. SYMPOSIUM ON LOCATION PROBLEMS: IN MEMORY OF LEON COOPER.: THE SHORTEST COVERING PATH PROBLEM: AN APPLICATION OF LOCATIONAL CONSTRAINTS TO NETWORK DESIGN , 1984 .
[81] E. Martins. On a multicriteria shortest path problem , 1984 .
[82] E. Martins. On a special class of bicriterion path problems , 1984 .
[83] L Berghmans,et al. Implementation of Health Facilities in a New City , 1984, The Journal of the Operational Research Society.
[84] James P. Ignizio,et al. A methodology for multicriteria network partitioning , 1984, Comput. Oper. Res..
[85] Ernesto de Queirós Vieira Martins. An algorithm to determine a path with minimal cost/capacity ratio , 1984, Discret. Appl. Math..
[86] J. Current,et al. The maximum covering/shortest path problem: A multiobjective network design and routing formulation , 1985 .
[87] James F. Cox,et al. Multiple criteria approach to the facilities layout problem , 1985 .
[88] R. Deckro,et al. Preference Trade-Offs In Capital Budgeting Decisions , 1985 .
[89] R. Rosenthal,et al. A Multiobjective Discrete Optimization Model for Land Allocation , 1985 .
[90] J. D. Schaffer,et al. Multiple Objective Optimization with Vector Evaluated Genetic Algorithms , 1985, ICGA.
[91] Arthur Warburton,et al. Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems , 1985, Math. Program..
[92] Roger Hartley. Vector Optimal Routing by Dynamic Programming , 1985 .
[93] N. K. Kwak,et al. Goal programming solutions to transportation problems with variable supply and demand requirements , 1985 .
[94] Hirotaka Nakayama,et al. Theory of Multiobjective Optimization , 1985 .
[95] H. W. Corley,et al. Shortest paths in networks with vector weights , 1985 .
[96] H. W. Corley,et al. Efficient spanning trees , 1985 .
[97] Leslie G. Valiant,et al. NP is as easy as detecting unique solutions , 1985, STOC '85.
[98] P. L. Kunsch,et al. Interactive Methods for Multi-Objective Integer Linear Programming , 1986 .
[99] L. M. Rasmussen. Zero--one programming with multiple criteria , 1986 .
[100] N. Sancho. A MULTI-OBJECTIVE ROUTING PROBLEM , 1986 .
[101] Pierre Hansen,et al. Efficient points on a network , 1986, Networks.
[102] Hemant Jain,et al. Concepts, Theory, and Techniques DISTRIBUTED COMPUTER SYSTEM DESIGN: A MULTICRITERIA DECISION‐MAKING METHODOLOGY* , 1986 .
[103] M. I. Henig. The shortest path problem with two objective functions , 1986 .
[104] Hokey Min,et al. Multiobjective design of transportation networks: taxonomy and annotation , 1986 .
[105] Yang Byung Park,et al. A solution of vehicle routing problems in a multiple objective environment , 1986 .
[106] Sang M. Lee,et al. The Multi‐Criteria Warehouse Location Problem Revisited , 1987 .
[107] I. Sergienko,et al. Finding the set of alternatives in discrete multicriterion problems , 1987 .
[108] Nancy V. Phillips,et al. A Weighting Function for Pre-emptive Multicriteria Assignment Problems , 1987 .
[109] B. Malakooti,et al. Multiple objective programming for the quadratic assignment problem , 1987 .
[110] Jared L. Cohon,et al. THE MEDIAN SHORTEST PATH PROBLEM : A MULTIOBJECTIVE APPROACH TO ANALYZE COST VS. ACCESSIBILITY IN THE DESIGN OF TRANSPORTATION NETWORKS , 1987 .
[111] E. Martins. On a particular quadratic network problem , 1987 .
[112] A. Warburton,et al. Approximation Methods for Multiple Criteria Travelling Salesman Problems , 1987 .
[113] J. Ringuest,et al. Interactive solutions for the linear multiobjective transportation problem , 1987 .
[114] Arthur Warburton,et al. Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..
[115] E. R. Clayton,et al. A LINEAR GOAL PROGRAMMING MODEL OF A MULTI-PERIOD, MULTI-COMMODITY NETWORK FLOW PROBLEM , 1987 .
[116] F. Robert Jacobs,et al. A layout planning systems with multiple criteria and a variable domain representation , 1987 .
[117] Timothy L. Urban. A multiple criteria model for the facilities layout problem , 1987 .
[118] Jeff R. Wright,et al. MICROCOMPUTER-BASED MULTIOBJECTIVE PERSONNEL MANAGEMENT MODEL , 1987 .
[119] Paolo Serafini,et al. Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems , 1987 .
[120] M. Goodchild,et al. The Multiobjective Vending Problem: A Generalization of the Travelling Salesman Problem , 1988 .
[121] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[122] Günther Ruhe,et al. Complexity results for multicriterial and parametric network flows using a pathological graph of Zadeh , 1988, ZOR Methods Model. Oper. Res..
[123] N. Sancho. A new type of multi-objective routing problem , 1988 .
[124] Krishan Rana,et al. A Model and Solution Algorithm for Optimal Routing of a Time-Chartered Containership , 1988, Transp. Sci..
[125] Ravindra K. Ahuja,et al. Minimum cost-reliability ratio path problem , 1988, Comput. Oper. Res..
[126] J. Current,et al. The Minimum‐Covering/Shortest‐Path Problem* , 1988 .
[127] Moshe Sniedovich,et al. A MULTI-OBJECTIVE ROUTING PROBLEM REVISITED , 1988 .
[128] Meir J. Rosenblatt,et al. Generating the Discrete Efficient Frontier to the Capital Budgeting Problem , 1989, Oper. Res..
[129] G. Rote,et al. Approximation of convex curves with application to the bicriterial minimum cost flow problem , 1989 .
[130] Włodzimierz Ogryczak,et al. A solver for the multi-objective transshipment problem with facility location , 1989 .
[131] Vicki Aaronson Hutson,et al. Maximal Direct Covering Tree Problems , 1989, Transp. Sci..
[132] B. Malakooti. Multiple objective facility layout: a heuristic to generate efficient alternatives , 1989 .
[133] Michel Minoux,et al. Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications , 1989, Math. Program..
[134] Yang-Byung Park,et al. An interactive computerized algorithm for multicriteria vehicle routing problems , 1989 .
[135] C. Keller. Algorithms to solve the orienteering problem: A comparison , 1989 .
[136] D. Shier,et al. An empirical investigation of some bicriterion shortest path algorithms , 1989 .
[137] Jun Wang,et al. A sensor-based accelerated approach for multi-attribute machinability and tool life evaluation , 1990 .
[138] Charles Sutcliffe,et al. Optimal Solution of a Vehicle-routeing Problem: Transporting Mentally Handicapped Adults to an Adult Training Centre , 1990 .
[139] D. J. White,et al. A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods , 1990 .
[140] Jared L. Cohon,et al. An interactive approach to identify the best compromise solution for two objective shortest path problems , 1990, Comput. Oper. Res..
[141] H. Moskowitz,et al. Generalized dynamic programming for multicriteria optimization , 1990 .
[142] Gunar E. Liepins,et al. Genetic Algorithms Applications to Set Covering and Traveling Salesman Problems , 1990 .
[143] Hokey Min,et al. Multiobjective analysis of facility location decisions , 1990 .
[144] Chelsea C. White,et al. Multiobjective A* , 1991, JACM.
[145] I. Murthy,et al. A parametric approach to solving bicriterion shortest path problems , 1991 .
[146] V. A. ev,et al. Complexity of vector optimization problems on graphs , 1991 .
[147] P. Simin Pulat,et al. Bicriteria network flow problems: Continuous case , 1991 .
[148] Dominique Peeters,et al. Location on networks , 1992 .
[149] H. Safer. Fast approximation schemes for multi-criteria combinatorial optimization , 1992 .
[150] Katta G. Murty,et al. Network programming , 1992 .
[151] P. Simin Pulat,et al. Efficient solutions for the bicriteria network flow problem , 1992, Comput. Oper. Res..
[152] Ernest H. Forman,et al. Decision Support for Media Selection Using the Analytic Hierarchy Process , 1992 .
[153] Ishwar Murthy,et al. Solving min‐max shortest‐path problems on a network , 1992 .
[154] Panagiotis Kouvelis,et al. Total unimodularity applications in bi-objective discrete optimization , 1992, Oper. Res. Lett..
[155] V. Emelichev,et al. On cardinality of the set of alternatives in discrete many-criterion problems , 1992 .
[156] Chelsea C. White,et al. Multiobjective, preference-based search in acyclic OR-graphs , 1992 .
[157] C. T. Tung,et al. A multicriteria Pareto-optimal path algorithm , 1992 .
[158] J. A. Hoogeveen,et al. Single-machine bicriteria scheduling , 1992 .
[159] Francesco Maffioli,et al. Note on Combinatorial Optimization with Max-Linear Objective Functions , 1993, Discret. Appl. Math..
[160] Vicki Aaronson Hutson,et al. Indirect covering tree problems on spanning tree networks , 1993 .
[161] M. Kostreva,et al. Time Dependency in Multiple Objective Dynamic Programming , 1993 .
[162] J. Shang. Multicriteria facility layout problem: An integrated approach , 1993 .
[163] Peter J. Fleming,et al. Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.
[164] T. Friesz,et al. The multiobjective equilibrium network design problem revisited: A simulated annealing approach , 1993 .
[165] Pitu B. Mirchandani,et al. Multiobjective routing of hazardous materials in stochastic networks , 1993 .
[166] Perry A. Appino,et al. Approximating the noninferior set in multiobjective linear programming problems , 1993 .
[167] Ralph E. Steuer,et al. A combined Tchebycheff/aspiration criterion vector interactive multiobjective programming procedure , 1993 .
[168] R. Bulfin,et al. Complexity of single machine, multi-criteria scheduling problems , 1993 .
[169] John R. Current,et al. Multiobjective transportation network design and routing problems: Taxonomy and annotation , 1993 .
[170] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[171] Rakesh V. Vohra,et al. Pareto optimality and a class of set covering heuristics , 1993, Ann. Oper. Res..
[172] P. S. Pulat,et al. Bicriteria network flow problems: Integer case , 1993 .
[173] Maria João Alves,et al. Interactive decision support for multiobjective transportation problems , 1993 .
[174] Yash P. Aneja,et al. A Generalized Time–Cost Trade-Off Transportation Problem , 1993 .
[175] Horst W. Hamacher,et al. On spanning tree problems with multiple objectives , 1994, Ann. Oper. Res..
[176] I. Sigal. Algorithms for solving the two-criterion large-scale travelling salesman problem , 1994 .
[177] Paolo Serafini,et al. Simulated Annealing for Multi Objective Optimization Problems , 1994 .
[178] R. J. Gallagher,et al. Constructing the set of efficient objective values in linear multiple objective transportation problems , 1994 .
[179] Kalyanmoy Deb,et al. Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.
[180] M. I. Henig. Efficient interactive methods for a class of multiattribute shortest path problems , 1994 .
[181] B. Jaumard,et al. A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives , 1994 .
[182] Murat Köksalan,et al. Scheduling with Multiple Criteria , 1994 .
[183] Abraham P. Punnen,et al. On combined minmax-minsum optimization , 1994, Comput. Oper. Res..
[184] Zilla Sinuany-Stern,et al. The One Dimensional Cutting Stock Problem Using Two Objectives , 1994 .
[185] Reda M.S. Abd El-Aal. An interactive technique for the cutting stock problem with multiple objectives , 1994 .
[186] E. L. Ulungu,et al. Multi‐objective combinatorial optimization problems: A survey , 1994 .
[187] I. Murthy,et al. An interactive procedure using domination cones for bicriterion shortest path problems , 1994 .
[188] David E. Goldberg,et al. A niched Pareto genetic algorithm for multiobjective optimization , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[189] Herminia I. Calvete,et al. An approach for the network flow problem with multiple objectives , 1995, Comput. Oper. Res..
[190] Mario Calderini,et al. A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling , 1995 .
[191] W. Ogryczak,et al. The Multiple Criteria Location Problem: 1. A Generalized Network Model and the Set of Efficient Solutions , 1995 .
[192] I. Melamed,et al. An investigation of linear convolution of criteria in multicriteria discrete programming , 1995 .
[193] Matthias Ehrgott. Lexicographic Max-Ordering - A Solution Concept for Multicriteria Combinatorial Optimization , 1995 .
[194] H. Ishibuchi,et al. MOGA: multi-objective genetic algorithms , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.
[195] Dominique Peeters,et al. Chapter 7 Location on networks , 1995 .
[196] Volker Nissen,et al. On Using Penalty Functions and Multicriteria Optimisation Techniques in Facility Layout , 1995 .
[197] J. A. Mesa,et al. Multiobjective routing problems , 1995 .
[198] Abraham P. Punnen,et al. Minmax combinatorial optimization , 1995 .
[199] Peter J. Fleming,et al. An Overview of Evolutionary Algorithms in Multiobjective Optimization , 1995, Evolutionary Computation.
[200] D. Schweigert. Vector-Weighted Matchings , 1995 .
[201] Yong Shi. A Transportation model with multiple criteria and multiple constraint levels , 1995 .
[202] Horst W. Hamacher,et al. A note onK best network flows , 1995, Ann. Oper. Res..
[203] J. Orlin,et al. Fast Approximation Schemes for Multi-Criteria Flow, Knapsack, and Scheduling Problems , 1995 .
[204] Mauro Dell'Amico,et al. on Some Multicriteria Arborescence Problems: Complexity and Algorithms , 1996, Discret. Appl. Math..
[205] Minghe Sun,et al. Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors , 1996, INFORMS J. Comput..
[206] Herminia I. Calvete,et al. A Sequential Network-Based Approach for the Multiobjective Network Flow Problem with Preemptive Priorities , 1996 .
[207] D. Lane,et al. Interactive Multiple Criteria Optimization for Capital Budgeting in a Canadian Telecommunications Company , 1996 .
[208] Mikael Lind,et al. On bicriterion minimal spanning trees: An approximation , 1996, Comput. Oper. Res..
[209] Masood A. Badri,et al. A two-stage multiobjective scheduling model for [faculty-course-time] assignments , 1996 .
[210] G. Tzeng,et al. Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower , 1996 .
[211] Mike Wright,et al. A comparison of neighborhood search techniques for multi-objective combinatorial problems , 1996, Comput. Oper. Res..
[212] M. Eben-Chaime. Parametric solution for linear bicriteria knapsack models , 1996 .
[213] Gilbert Laporte,et al. Metaheuristics: A bibliography , 1996, Ann. Oper. Res..
[214] Chan-Nan Lu,et al. Implementation of network sensitivity calculation on vector computers , 1996 .
[215] Minghe Sun,et al. Solving Multiple Objective Programming Problems Using Feed-Forward Artificial Neural Networks: The Interactive FFANN Procedure , 1996 .
[216] Abraham P. Punnen,et al. An O(m log n) algorithm for the max + sum spanning tree problem , 1996 .
[217] José Rui Figueira. L'approche interactive dans le cas des problèmes de flot multicritères , 1996 .
[218] Murat Köksalan,et al. Note: Bicriteria scheduling for minimizing flow time and maximum tardiness , 1996 .
[219] E. Ehrgott. On matroids with multiple objectives , 1996 .
[220] Lorraine R. Gardiner,et al. A Bibliographic Survey of the Activities and International Nature of Multiple Criteria Decision Making , 1996 .
[221] W. Ogryczak,et al. The Multiple Criteria Location Problem: 2. Preference-Based Techniques and Interactive Decision Support , 1996 .
[222] Alan D. Christiansen,et al. An empirical study of evolutionary techniques for multiobjective optimization in engineering design , 1996 .
[223] I. Melamed,et al. A computational investigation of linear parametricization of criteria in multicriteria discrete programming , 1996 .
[224] Kathrin Klamroth,et al. Non-connected Efficiency Graphs in Multiple Criteria Combinatorial Optimization , 1997 .
[225] Soung Hie Kim,et al. An improved interactive hybrid method for the linear multi-objective knapsack problem , 1997, Comput. Oper. Res..
[226] Pratyush Sen,et al. A Multiple Criteria Genetic Algorithm for Containership Loading , 1997, ICGA.
[227] C. Goh,et al. A method for convex curve approximation , 1997 .
[228] J. Teghem,et al. Solving Multi-Objective Knapsack Problem by a Branch-and-Bound Procedure , 1997 .
[229] M. Ehrgott,et al. Equivalence of Balance Points and Pareto Solutions in Multiple-Objective Programming , 1997 .
[230] Murat Köksalan,et al. Bicriteria Scheduling: Minimizing Flowtime and Maximum Earliness on a Single Machine , 1997 .
[231] João C. N. Clímaco,et al. Multicriteria Integer Programming: An Overview of the Different Algorithmic Approaches , 1997 .
[232] A. Jaszkiewicz,et al. Fuzzy project scheduling with multiple criteria , 1997, Proceedings of 6th International Fuzzy Systems Conference.
[233] Andrzej Jaszkiewicz,et al. Pareto Simulated Annealing , 1997 .
[234] Wlodzimierz Ogryczak,et al. On the lexicographic minimax approach to location problems , 1997, Eur. J. Oper. Res..
[235] Adli Mustafa,et al. Characteristics of the Efficient Solutions of Bicriteria and Tricriteria Network Flow Problems , 1997 .
[236] M. John Hodgson,et al. Testing a Bicriterion Location-Allocation Model with Real-World Network Traffic: The Case of Edmonton, Canada , 1997 .
[237] Ernesto de Queirós Vieira Martins,et al. An algorithm for the quickest path problem , 1997, Oper. Res. Lett..
[238] Mauro Dell'Amico,et al. Annotated Bibliographies in Combinatorial Optimization , 1997 .
[239] Ralph E. Steuer,et al. A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming , 1997, Oper. Res..
[240] Minghe Sun. Applying Tabu search to multiple objective combinatorial optimization problems , 1997 .
[241] Xavier Gandibleux,et al. A Tabu Search Procedure to Solve MultiObjective Combinatorial Optimization Problems , 1997 .
[242] M. Ehrgott,et al. Connectedness of efficient solutions in multiple criteria combinatorial optimization , 1997 .
[243] I. Melamed,et al. The linear convolution of criteria in the bicriteria traveling salesman problem , 1997 .
[244] Minghe Sun,et al. Tabu search multi-criteria decision model for facility location planning , 1997 .
[245] Michael Pilegaard Hansen,et al. Metaheuristics for multiple objective combinatorial optimization , 1998 .
[246] Mark Goh,et al. Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINAS , 1998, Comput. Oper. Res..
[247] Lothar Thiele,et al. An evolutionary algorithm for multiobjective optimization: the strength Pareto approach , 1998 .
[248] M. Hansen,et al. Evaluating the quality of approximations to the non-dominated set , 1998 .
[249] William A. Wallace,et al. Routing of Hazardous Materials , 1998 .
[250] M. Gen,et al. Solving Multi-objective Transportation Problems by Spanning Tree-based Genetic Algorithm , 1998 .
[251] J Figueira,et al. Using mathematical programming heuristics in a multicriteria network flow context , 1998, J. Oper. Res. Soc..
[252] S. R. Arora,et al. Linearization approach to multi-objective quadratic set covering problem , 1998 .
[253] Jacques Teghem,et al. Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem , 1998, J. Glob. Optim..
[254] Andrzej Jaszkiewicz,et al. Interactive analysis of multiple-criteria project scheduling problems , 1998, Eur. J. Oper. Res..
[255] Włodzimierz Ogryczak. Location problems from the multiple criteria perspective: efficient solutions , 1998 .
[256] S. Prasad. Approximation error analysis in bicriteria heuristics , 1998 .
[257] S. Alonso,et al. The problem of the optimal biobjective spanning tree , 1998, Eur. J. Oper. Res..
[258] Donna F. Davis,et al. A multi-objective course scheduling model: Combining faculty preferences for courses and times , 1998, Comput. Oper. Res..
[259] Amr K. Mortagy,et al. A multi-objective model for locating fire stations , 1998, Eur. J. Oper. Res..
[260] Mitsuo Gen,et al. Spanning tree-based genetic algorithm for bicriteria transportation problem , 1998 .
[261] Anna Sciomachen,et al. A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks , 1998, Eur. J. Oper. Res..
[262] M. Azizoglu,et al. Minimizing flowtime and maximum earliness on a single machine , 1998 .
[263] Piotr Czyzżak,et al. Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization , 1998 .
[264] M. Ehrgott. Discrete Decision Problems, Multiple Criteria Optimization Classes and Lexicographic Max-Ordering , 1998 .
[265] I. Melamed,et al. Numerical analysis of tricriteria tree and assignment problems , 1998 .
[266] Mitsuo Gen,et al. A spanning tree-based genetic algorithm for bicriteria topological network design , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).
[267] Blas Pelegrín,et al. On the sum-max bicriterion path problem , 1998, Comput. Oper. Res..
[268] Jacques Teghem,et al. Efficiency of interactive multi-objective simulated annealing through a case study , 1998, J. Oper. Res. Soc..
[269] Andrzej Jaszkiewicz,et al. Fuzzy Multi-Mode Resource-Constrained Project Scheduling with multiple Objectives , 1999 .
[270] Hiroaki Ishii,et al. Bi-criteria scheduling problem on three identical parallel machines , 1999 .
[271] M. Köksalan. A heuristic approach to bicriteria scheduling , 1999 .
[272] Geoffrey T. Parks,et al. Multiobjective optimization of PWR reload core designs using simulated annealing , 1999 .
[273] DebKalyanmoy. Multi-objective genetic algorithms , 1999 .
[274] M. Labbé,et al. Multicriteria network location problems with sum objectives , 1999 .
[275] Vincent t'Kindt. Etude des problèmes d'ordonnancement multicritères , 1999 .
[276] I. Melamed,et al. COMBINATORIAL OPTIMIZATION PROBLEMS WITH TWO AND THREE CRITERIA , 1999 .
[277] F. Abdelaziz,et al. A Hybrid Heuristic for Multiobjective Knapsack Problems , 1999 .
[278] A. Goswami,et al. Multiobjective transportation problem with interval cost, source and destination parameters , 1999, Eur. J. Oper. Res..
[279] V. T'kindt,et al. Some guidelines to solve multicriteria scheduling problems , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).
[280] A. Baykasoğlu,et al. A TABOO SEARCH BASED APPROACH TO FIND THE PARETO OPTIMAL SET IN MULTIPLE OBJECTIVE OPTIMIZATION , 1999 .
[281] Chengbin Chu,et al. Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems , 1999, Oper. Res..
[282] Geoffrey T. Parks,et al. Simulated annealing: An alternative approach to true multiobjective optimization , 1999 .
[283] Yang-Byung Park,et al. A heuristic for bi-objective vehicle routing with time window constraints , 1999 .
[284] Mitsuo Gen,et al. Genetic algorithm approach on multi-criteria minimum spanning tree problem , 1999, Eur. J. Oper. Res..
[285] M. Ehrgott,et al. Geometric methods to solve max-ordering location problems , 1999 .
[286] Gerald W. Evans,et al. A multiple objective integer programming approach for planning franchise expansion , 1999 .
[287] E. L. Ulungu,et al. MOSA method: a tool for solving multiobjective combinatorial optimization problems , 1999 .
[288] M. Ehrgott. A Characterization of Lexicographic Max-Ordering Solutions , 1999 .
[289] David Corne,et al. The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[290] João C. N. Clímaco,et al. An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions , 1999, Comput. Oper. Res..
[291] D. Schweigert,et al. Ordered graphs and minimal spanning trees , 1999 .
[292] Serpil Sayin,et al. A bicriteria approach to the two-machine flow shop scheduling problem , 1999, Eur. J. Oper. Res..
[293] I. Melamed,et al. Study of the linear parametrization of criteria in the bicriteria Knapsack problem , 1999 .
[294] Lothar Thiele,et al. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..
[295] Eckart Zitzler,et al. Evolutionary algorithms for multiobjective optimization: methods and applications , 1999 .
[296] Thomas Hanne,et al. On the convergence of multiobjective evolutionary algorithms , 1999, Eur. J. Oper. Res..
[297] T. Kalu. Capital budgeting under uncertainty: An extended goal programming approach , 1999 .
[298] Andrzej Jaszkiewicz,et al. Solving multiple criteria choice problems by interactive trichotomy segmentation , 1999, Eur. J. Oper. Res..
[299] M. Ehrgott. Approximation algorithms for combinatorial multicriteria optimization problems , 2000 .
[300] Philippe Fortemps,et al. Performance of the MOSA Method for the Bicriteria Assignment Problem , 2000, J. Heuristics.
[301] V. Emelichev,et al. Sensivity analysis of efficient solutions of the vector problem of minimisation of linear forms on a set of permutations , 2000 .
[302] M. Wiecek,et al. Dynamic programming approaches to the multiple criteria knapsack problem , 2000 .
[303] Michael Pilegaard Hansen. Use of Substitute Scalarizing Functions to Guide a Local Search Based Heuristic: The Case of moTSP , 2000, J. Heuristics.
[304] Serpil Sayin,et al. Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming , 2000, Math. Program..
[305] M. Wiecek,et al. Time-Dependent Capital Budgeting with Multiple Criteria , 2000 .
[306] Andrzej Jaszkiewicz,et al. Pareto Simulated Annealing for Fuzzy Multi-Objective Combinatorial Optimization , 2000, J. Heuristics.
[307] M. Ehrgott,et al. Nadir Values: Computation and Use in Compromise Programming , 2000 .
[308] Carlos A. Coello Coello,et al. An updated survey of GA-based multiobjective optimization techniques , 2000, CSUR.
[309] Jacques Teghem,et al. An interactive heuristic method for multi-objective combinatorial optimization , 2000, Comput. Oper. Res..
[310] Mauro Dell'Amico,et al. Combining Linear and Non-Linear Objectives in Spanning Tree Problems , 2000, J. Comb. Optim..
[311] Kin Keung Lai,et al. A fuzzy approach to the multiobjective transportation problem , 2000, Comput. Oper. Res..
[312] Murat Köksalan,et al. A Simulated Annealing Approach to Bicriteria Scheduling Problems on a Single Machine , 2000, J. Heuristics.
[313] João C. N. Clímaco,et al. An Interactive Method for 0-1 Multiobjective Problems Using Simulated Annealing and Tabu Search , 2000, J. Heuristics.
[314] A.W.J. Kolen,et al. Solving a bi-criterion cutting stock problem with open-ended demand: a case study , 2000, J. Oper. Res. Soc..
[315] Antonio Sedeño-Noda,et al. The biobjective minimum cost flow problem , 2000, Eur. J. Oper. Res..
[316] Luis C. Dias,et al. Shortest path problems with partial information: Models and algorithms for detecting dominance , 2000, Eur. J. Oper. Res..
[317] Yang-Byung Park. A solution of the bicriteria vehicle scheduling problems with time and area-dependent travel speeds , 2000 .
[318] Minghe Sun,et al. Interactive multiple objective programming using Tchebycheff programs and artificial neural networks , 2000, Comput. Oper. Res..
[319] Keith A. Seffen,et al. A SIMULATED ANNEALING ALGORITHM FOR MULTIOBJECTIVE OPTIMIZATION , 2000 .
[320] Arnaud Fréville,et al. Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case , 2000, J. Heuristics.
[321] Zbigniew Michalewicz,et al. Evolutionary Computation 2 , 2000 .
[322] M. Hansen,et al. Tabu search for multiobjective combinatorial optimization : TAMOCO , 2000 .
[323] V. K. Jayaraman,et al. Multiobjective ant algorithm for continuous function optimizatio: combination of strength Pareto fitness assignment and thermodynamic clustering , 2000 .
[324] Kim Allan Andersen,et al. A label correcting approach for solving bicriterion shortest-path problems , 2000, Comput. Oper. Res..
[325] Dorotea De Luca Cardillo,et al. A DEA model for the efficiency evaluation of nondominated paths on a road network , 2000, Eur. J. Oper. Res..
[326] Thomas Hanne,et al. Global Multiobjective Optimization Using Evolutionary Algorithms , 2000, J. Heuristics.
[327] Jorge Pinho de Sousa,et al. Using metaheuristics in multiobjective resource constrained project scheduling , 2000, Eur. J. Oper. Res..
[328] Edmund K. Burke,et al. Combining Hybrid Metaheuristics and Populations for the Multiobjective Optimisation of Space Allocation Problems , 2001 .
[329] H. Morita,et al. Experimental feedback on bioobjective permutation scheduling problems solved with a population heuristic , 2001 .
[330] Daniel Merkle,et al. Bi-Criterion Optimization with Multi Colony Ant Algorithms , 2001, EMO.
[331] Xavier Gandibleux,et al. The Supported Solutions Used as a Genetic Information in a Population Heuristics , 2001, EMO.
[332] Adil Baykasoğlu. MOAPPS 1.0: Aggregate production planning using the multiple-objective tabu search , 2001 .
[333] Andrzej Jaszkiewicz. Comparison of local search-based metaheuristics on the multiple objective knapsack problem , 2001 .
[334] Jean-Charles Billaut,et al. Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry , 2001, Eur. J. Oper. Res..
[335] Jean-Charles Billaut,et al. Multicriteria scheduling problems: a survey , 2001, RAIRO Oper. Res..
[336] Sydney C. K. Chu,et al. A goal programming model for crew duties generation , 2001 .
[337] Hans Kellerer,et al. Approximating Multi-objective Knapsack Problems , 2001, WADS.
[338] A Baykasoǧlu,et al. Goal programming using multiple objective tabu search , 2001, J. Oper. Res. Soc..
[339] Kathrin Klamroth,et al. A time-dependent multiple criteria single-machine scheduling problem , 2001, Eur. J. Oper. Res..
[340] Andrzej Jaszkiewicz,et al. Multiple objective metaheuristic algorithms for combinatorial optimization , 2001 .
[341] A. Jaszkiewicz. Multiple Objective Genetic Local Search Algorithm , 2001 .
[342] Xavier Gandibleux. Quick Evaluation of the Efficient Solution Set for the Biobjective Knapsack Problem , 2001 .
[343] M. Köksalan,et al. An Interactive Genetic Algorithm Applied to the Multiobjective Knapsack Problem , 2001 .
[344] M. Ehrgott,et al. Computing Nadir Values in Three Objectives , 2001 .
[345] Waiel F. Abd El-Wahed,et al. A multi-objective transportation problem under fuzziness , 2001, Fuzzy Sets Syst..
[346] Marco Laumanns,et al. On the Effects of Archiving, Elitism, and Density Based Selection in Evolutionary Multi-objective Optimization , 2001, EMO.
[347] Antonio Sedeño-Noda,et al. An algorithm for the biobjective integer minimum cost flow problem , 2001, Comput. Oper. Res..
[348] Félix Mora-Camino,et al. A Bi-Criterion Approach for the Airlines Crew Rostering Problem , 2001, EMO.
[349] W. Carlyle,et al. A new technique to compare algorithms for bi-criteria combinatorial optimization problems , 2001 .
[350] Joshua D. Knowles. Local-search and hybrid evolutionary algorithms for Pareto optimization , 2002 .
[351] Michael M. Kostreva,et al. Multiple Objective Path Optimization for Time Dependent Objective Functions , 2002 .
[352] Marc Gravel,et al. Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic , 2002, Eur. J. Oper. Res..
[353] F. Sibel Salman,et al. Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem , 2002, J. Heuristics.
[354] Horst W. Hamacher,et al. Multicriteria Semi-Obnoxious Network Location Problems (MSNLP) with Sum and Center Objectives , 2002, Ann. Oper. Res..
[355] Hans Kellerer,et al. Approximating Multiobjective Knapsack Problems , 2002, Manag. Sci..
[356] Andrzej Jaszkiewicz,et al. Genetic local search for multi-objective combinatorial optimization , 2022 .
[357] A. Jaszkiewicz. On the Computational Effectiveness of Multiple Objective Metaheuristics , 2002 .
[358] Mehrdad Tamiz,et al. Multi-objective meta-heuristics: An overview of the current state-of-the-art , 2002, Eur. J. Oper. Res..
[359] Justo Puerto,et al. Multiobjective solution of the uncapacitated plant location problem , 2003, Eur. J. Oper. Res..
[360] Matthias Ehrgott,et al. Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach , 2003, European Journal of Operational Research.
[361] Günther Ruhe,et al. ε-Optimality for bicriteria programs and its application to minimum cost flows , 1990, Computing.