Metaheuristics: A bibliography
暂无分享,去创建一个
[1] Jennifer Ryan,et al. A Two-Dimensional Genetic Algorithm for the Ising Problem , 1991, Complex Syst..
[2] S. H. Huang,et al. Artificial neural networks in manufacturing: concepts, applications, and perspectives , 1994 .
[3] John N. Hooker,et al. Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search , 1995, Transp. Sci..
[4] Wayne S. DeSarbo,et al. A simulated annealing methodology for clusterwise linear regression , 1989 .
[5] T. S. Raghu,et al. Due-date setting methodologies based on simulated annealing—an experimental study in a real-life job shop , 1995 .
[6] Samuel Pierre,et al. Topological design of computer communication networks using simulated annealing , 1995 .
[7] M. J. Fluss,et al. 2.1. Introduction , 1983 .
[8] Kenneth A. De Jong,et al. An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms , 1990, PPSN.
[9] Fred Glover,et al. TSP Ejection Chains , 1997, Discret. Appl. Math..
[10] E. Nowicki,et al. A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .
[11] Gunar E. Liepins,et al. Global convergence of genetic algorithms , 1992, Optics & Photonics.
[12] Jadranka Skorin-Kapov,et al. Connection Machine implementation of a tabu search algorithm for the traveling salesman problem , 1993 .
[13] C. B. Lucasius,et al. Understanding and using genetic algorithms Part 1. Concepts, properties and context , 1993 .
[14] Karl Heinz Hoffmann,et al. Concepts in Optimizing Simulated Annealing Schedules: An Adaptive Approach for Parallel and Vector Machines , 1991 .
[15] Reinhard Männer,et al. Parallel problem solving from nature : PPSN III; proceedings / International Conference on Evolutionary Computation, The Third Conference on Parallel Problem Solving from Nature, Jerusalem, Israel, October 9 - 14, 1994 , 1994 .
[16] Itsuo Kumazawa,et al. Single Minimum Method for Combinatorial Optimization Problems and Its Application to the TSP Problem , 1993 .
[17] J. Hofmann,et al. Placement heuristics for generation of FMS layouts , 1990 .
[18] Howard James,et al. Software for Studying and Developing Applications of Artificial Neural Networks@@@ExploreNew 3000 , 1994 .
[19] J Potvin,et al. A tabu search heuristic for the vehicle routing problem with time windows , 1992 .
[20] Jin-Kao Hao,et al. An empirical comparison of two evolutionary methods for satisfiability problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.
[21] Weng Tat Chan,et al. ROAD-MAINTENANCE PLANNING USING GENETIC ALGORITHMS.. , 1994 .
[22] E. Bonomi,et al. The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm , 1984 .
[23] S Openshaw,et al. Algorithms for Reengineering 1991 Census Geography , 1995, Environment & planning A.
[24] John H. Holland,et al. Distributed genetic algorithms for function optimization , 1989 .
[25] Jochen Heistermann. The Application of a Genetic Approach as an Algorithm for Neural Networks , 1990, PPSN.
[26] S. Wu,et al. Steady-state genetic algorithms for discrete optimization of trusses , 1995 .
[27] Ibrahim H. Osman,et al. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..
[28] Jacobus E. Rooda,et al. NEURAL NETWORKS FOR JOB-SHOP SCHEDULING , 1994 .
[29] Gilbert Laporte,et al. A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .
[30] Rema Padman,et al. Neural Networks for Heuristic Selection: An Application in Resource-Constrained Project Scheduling , 1995 .
[31] Edmund K. Burke,et al. Specialised Recombinative Operators for Timetabling Problems , 1995, Evolutionary Computing, AISB Workshop.
[32] Gerrit Kateman,et al. Gates Towards Evolutionary Large-scale Optimization: A Software-oriented Approach to Genetic Algorithms - I. General Perspective , 1994, Comput. Chem..
[33] Edoardo Amaldi,et al. A Review of Combinatorial Problems Arising in Feedforward Neural Network Design , 1994, Discret. Appl. Math..
[34] Bull,et al. An Overview of Genetic Algorithms: Pt 2, Research Topics , 1993 .
[35] G. Harhalakis,et al. Manufacturing cell design using simulated annealing: An industrial application , 1990, J. Intell. Manuf..
[36] Rudolf Mathar,et al. Channel assignment in cellular radio networks , 1993 .
[37] Jin-Kao Hao,et al. An evolutionary approach for frequency assignment in cellular radio networks , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.
[38] Chuen-Lung Chen,et al. An application of genetic algorithms for flow shop problems , 1995 .
[39] Z. Michalewicz,et al. A genetic algorithm for the linear transportation problem , 1991, IEEE Trans. Syst. Man Cybern..
[40] Joachim M. Buhmann,et al. Complexity Optimized Data Clustering by Competitive Neural Networks , 1993, Neural Computation.
[41] S. Arunkumar,et al. A randomized heuristics for the mapping problem: The genetic approach , 1992, Parallel Comput..
[42] Roger L. Wainwright,et al. A genetic algorithm for packing in three dimensions , 1992, SAC '92.
[43] L. Darrell Whitley,et al. International Workshop on Combinations of Genetic Algorithms and Neural Networks , 1992 .
[44] Ronald G. Askin,et al. A note on the effect of neighborhood structure in simulated annealing , 1991, Comput. Oper. Res..
[45] Varghese S. Jacob,et al. A genetics-based hybrid scheduler for generating static schedules in flexible manufacturing contexts , 1993, IEEE Trans. Syst. Man Cybern..
[46] Olivier C. Martin,et al. Combining simulated annealing with local search heuristics , 1993, Ann. Oper. Res..
[47] A. Vannelli,et al. A VLSI placement method using Tabu search , 1992 .
[48] Norman M. Sadeh,et al. Focused simulated annealing search: An application to job shop scheduling , 1996, Ann. Oper. Res..
[49] Valmir C. Barbosa,et al. An Occam-based evaluation of a parallel version of simulated annealing , 1990, Microprocessing and Microprogramming.
[50] Lawrence Davis,et al. A Genetic Algorithm for Survivable Network Design , 1993, International Conference on Genetic Algorithms.
[51] Jean-Yves Potvin. A GENETIC APPROACH TO THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS. , 1993 .
[52] Wu-Shiung Feng,et al. An analog neural network approach to global routing problem , 1991 .
[53] Y Takefuji,et al. A Near-Optimum Parallel Planarization Algorithm , 1989, Science.
[54] D. Janaki Ram,et al. Parallel Simulated Annealing Algorithms , 1996, J. Parallel Distributed Comput..
[55] Peter Greistorfer,et al. Computational Experiments with Heuristics for a Capacitated Arc Routing Problem , 1995 .
[56] Bernard A. Nadel,et al. Constraint satisfaction algorithms 1 , 1989, Comput. Intell..
[57] Peter T. Cummings,et al. Flowshop sequencing with non-permutation schedules , 1991 .
[58] K. C. Chan,et al. A study of genetic crossover operations on the facilities layout problem , 1994 .
[59] David Harel,et al. Randomized Graph Drawing with Heavy-Duty Preprocessing , 1995, J. Vis. Lang. Comput..
[60] John A. Nestor,et al. SALSA: a new approach to scheduling with timing constraints , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[61] P. Farris,et al. A Model for Determining Retail Product Category Assortment and Shelf Space Allocation , 1994 .
[62] J. Wesley Barnes,et al. A tabu search experience in production scheduling , 1993, Ann. Oper. Res..
[63] Fred W. Glover,et al. Applying tabu search with influential diversification to multiprocessor scheduling , 1994, Comput. Oper. Res..
[64] M.J. Flynn. B72-3 Computer Structures, Readings and Examples , 1972, IEEE Transactions on Computers.
[65] Minesh B. Amin,et al. Generalization by Neural Networks , 1992, IEEE Trans. Knowl. Data Eng..
[66] Melanie Mitchell,et al. An introduction to genetic algorithms , 1996 .
[67] V. Jorge Leon,et al. Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling , 1995 .
[68] Nam-Ky Nguyen,et al. An algorithm for constructing optimal resolvable incomplete block designs , 1993 .
[69] Shokri Z. Selim,et al. A global algorithm for the fuzzy clustering problem , 1993, Pattern Recognit..
[70] Pei‐Chann Chang,et al. A simulated annealing approach to parallel processor scheduling problems with precedence relations , 1994 .
[71] Richard L. Church,et al. Heuristic solution approaches to operational forest planning problems , 1995 .
[72] Patrick Prosser,et al. HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..
[73] Xin Yao,et al. Finding Approximate Solutions to NP-Hard Problems by Neural Networks is Hard , 1992, Inf. Process. Lett..
[74] Pierre Roussel-Ragot,et al. A problem independent parallel implementation of simulated annealing: models and experiments , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[75] GUNAR E. LIEPINS,et al. Representational issues in genetic optimization , 1990, J. Exp. Theor. Artif. Intell..
[76] Victor J. Rayward-Smith,et al. Modern Heuristic Search Methods , 1996 .
[77] Bikas K. Chakrabarti,et al. The travelling salesman problem on a dilute lattice: a simulated annealing study , 1988 .
[78] Rafael Martí,et al. A tabu thresholding algorithm for arc crossing minimization in bipartite graphs , 1996, Ann. Oper. Res..
[79] Y. W. Wong,et al. Short-term hydrothermal scheduling. II. Parallel simulated annealing approach , 1994 .
[80] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[81] D. B. Hibbert. Genetic algorithms in chemistry , 1993 .
[82] John H. Kalivas. Optimization using variations of simulated annealing , 1992 .
[83] John J. Grefenstette,et al. A Parallel Genetic Algorithm , 1987, ICGA.
[84] C. P. Ravikumar,et al. Performance improvement of simulated annealing algorithms , 1990, Computer systems science and engineering.
[85] John N. Hooker,et al. Needed: An Empirical Science of Algorithms , 1994, Oper. Res..
[86] F. Boctor. A Jinear formulation of the machine-part cell formation problem , 1991 .
[87] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[88] Irène Charon,et al. The noising method: a new method for combinatorial optimization , 1993, Oper. Res. Lett..
[89] S. R. Thangiah,et al. Effect of genetic sectoring on vehicle routing problems with time windows , 1993, [1993] Proceedings IEEE International Conference on Developing and Managing Intelligent System Projects.
[90] John A. Miller,et al. An evaluation of local improvement operators for genetic algorithms , 1993, IEEE Trans. Syst. Man Cybern..
[91] David B. Fogel,et al. A Comparison of Evolutionary Programming and Genetic Algorithms on Selected Constrained Optimization Problems , 1995, Simul..
[92] T. Feo,et al. An algorithm for the manufacturing equipment selection problem , 1991 .
[93] Qiwen Wang,et al. Using artificial neural networks to solve the orienteering problem , 1995, Ann. Oper. Res..
[94] Stella Sofianopoulou,et al. Simulated annealing applied to the process allocation problem , 1992 .
[95] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..
[96] Larry W. Jacobs,et al. Cost analysis of alternative formulations for personnel scheduling in continuously operating organizations , 1995 .
[97] J. L. Lutton,et al. A simulated annealing algorithm for the computation of marginal costs of telecommunication links , 1996 .
[98] N. Hu. Tabu search method with random moves for globally optimal design , 1992 .
[99] D. Skorin-Kapov,et al. On tabu search for the location of interacting hub facilities , 1994 .
[100] Vassilios E. Theodoracatos,et al. The optimal packing of arbitrarily-shaped polygons using simulated annealing and polynomial-time cooling schedules , 1995 .
[101] Jun Wang. Artificial neural networks versus natural neural networks: A connectionist paradigm for preference assessment , 1994, Decis. Support Syst..
[102] Chae Y. Lee,et al. Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights , 1995 .
[103] Geoffrey C. Fox,et al. Parallel Physical Optimization Algorithms for Data Mapping , 1992, CONPAR.
[104] A. Trouvé,et al. Partially parallel simulated annealing: Low and high temperature approach of the invariante measure , 1992 .
[105] L. Ingber. Very fast simulated re-annealing , 1989 .
[106] J. Jansen,et al. An Annealing Algorithm for Searching Optimal Block Designs , 1992 .
[107] Petar D. Simic,et al. Statistical mechanics as the underlying theory of ‘elastic’ and ‘neural’ optimisations , 1990 .
[108] Martin Zachariasen,et al. Tabu Search on the Geometric Traveling Salesman Problem , 1996 .
[109] David M. Skapura,et al. Neural networks - algorithms, applications, and programming techniques , 1991, Computation and neural systems series.
[110] Hsu-Pin Wang,et al. Modified simulated annealing for multiple-objective engineering design optimization , 1992, J. Intell. Manuf..
[111] Yong Gao,et al. Comments on "Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. I. Basic properties of selection and mutation" [and reply] , 1998, IEEE Trans. Neural Networks.
[112] Fred W. Glover,et al. A user's guide to tabu search , 1993, Ann. Oper. Res..
[113] Heinz Mühlenbein,et al. Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization , 1989, Parallelism, Learning, Evolution.
[114] Rene Victor Valqui Vidal,et al. The afforestation problem: A heuristic method based on simulated annealing , 1992 .
[115] John J. Grefenstette,et al. Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.
[116] Thomas Lengauer,et al. A simulated annealing approach to the nesting problem in the textile manufacturing industry , 1995, Ann. Oper. Res..
[117] Panos M. Pardalos,et al. Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP , 1996, TOMS.
[118] Sheldon H. Jacobson,et al. How difficult is the frequency selection problem? , 1995, Oper. Res. Lett..
[119] Chih-Ju Chou,et al. A multiobjective optimization approach to loading balance and grounding planning in three-phase four-wire distribution systems , 1994 .
[120] C. Lockwood,et al. Harvest scheduling with spatial constraints: a simulated annealing approach , 1993 .
[121] Tong Sun,et al. Algorithms for the vehicle routing problems with time deadlines , 1993 .
[122] J. David Schaffer,et al. Proceedings of the third international conference on Genetic algorithms , 1989 .
[123] Alberto L. Sangiovanni-Vincentelli,et al. A Parallel Simulated Annealing Algorithm for the Placement of Macro-Cells , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[124] Nostrand Reinhold,et al. the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .
[125] Fred W. Glover,et al. Genetic algorithms and tabu search: Hybrids for optimization , 1995, Comput. Oper. Res..
[126] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.
[127] Kathryn A. Dowsland,et al. A Timetabling Problem in which Clashes are Inevitable , 1990 .
[128] Carlos F. Daganzo,et al. Centralized hub-terminal geometric concepts. II, Baggage and extensions , 1991 .
[129] J. Galletly. An Overview of Genetic Algorithms , 1992 .
[130] David Ben-Arieh,et al. Annealing method for PCB assembly scheduling on two sequential machines , 1992 .
[131] Mark Wallace,et al. Constraint logic programming for scheduling and planning , 1995 .
[132] Yi-Zeng Liang,et al. Cluster analysis by the K-means algorithm and simulated annealing , 1994 .
[133] Gary W. Fischer,et al. A neural algorithm for finding the shortest flow path for an automated guided vehicle system , 1995 .
[134] D. Werra,et al. Some experiments with simulated annealing for coloring graphs , 1987 .
[135] Sankar K. Pal,et al. Directed Mutation in Gennetic Algorithms , 1994, Inf. Sci..
[136] Akio Yamamoto,et al. Scheduling for minimizing total actual flow time by neural networks , 1992 .
[137] Mirko Krivánek,et al. Simulated Annealing: A Proof of Convergence , 1994, IEEE Trans. Pattern Anal. Mach. Intell..
[138] Ming Liang,et al. Solving the combined part sequencing and tool replacement problem for an automated machining center: a tabu search approach , 1995 .
[139] J. Fontanari,et al. Stochastic versus deterministic update in simulated annealing , 1990 .
[140] Erwin Pesch,et al. Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..
[141] Donald E. Brown,et al. A parallel heuristic for quadratic assignment problems , 1989, Comput. Oper. Res..
[142] Sam R. Thangiah,et al. Vehicle Routing with Time Windows using Genetic Algorithms , 1997 .
[143] C. Bierwirth. A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .
[144] Bruce E. Hajek,et al. Cooling Schedules for Optimal Annealing , 1988, Math. Oper. Res..
[145] Harukazu Igarashi,et al. A solution for combinational optimization problems using a two-layer random field model-mean-field approximation , 1994, Systems and Computers in Japan.
[146] H. Das,et al. Scheduling of serial multiproduct batch processes via simulated annealing , 1990 .
[147] Erkki Oja,et al. Improved Simulated Annealing, Boltzmann Machine, and Attributed Graph Matching , 1990, EURASIP Workshop.
[148] P. C. Schuur,et al. Packing 16, 17 or 18 circles in an equilateral triangle , 1995, Discret. Math..
[149] Thomas Bäck,et al. Genetic Algorithms and Evolution Strategies - Similarities and Differences , 1990, PPSN.
[150] A. Skinner,et al. Neural networks in computational materials science: training algorithms , 1995 .
[151] Erik Rolland. Abstract heuristic search methods for graph partitioning , 1991 .
[152] David L. Woodruff,et al. Simulated annealing and tabu search: Lessons from a line search , 1994, Comput. Oper. Res..
[153] J. Beasley,et al. A genetic algorithm for the set covering problem , 1996 .
[154] Maciej Matysiak. Efficient Optimization of Large Join Queries Using Tabu Search , 1995, Inf. Sci..
[155] Roberto Brunelli,et al. Training neural nets through stochastic minimization , 1994, Neural Networks.
[156] Santanu Chaudhury,et al. Genetic Algorithm for Node Partitioning Problem and Applications in VLSI Design , 1993 .
[157] Panos M. Pardalos,et al. The maximum clique problem , 1994, J. Glob. Optim..
[158] D. M. Titterington,et al. Neural Networks: A Review from a Statistical Perspective , 1994 .
[159] Daniel Costa,et al. An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem , 1995 .
[160] Attahiru Sule Alfa,et al. Integrating the grouping and layout problems in cellular manufacturing systems , 1992 .
[161] Robert H. Storer,et al. Problem space local search for number partitioning , 1996, Ann. Oper. Res..
[162] Chih-Ming Liu,et al. Machine cell formation: using the simulated annealing algorithm , 1993 .
[163] Roberto Battiti,et al. The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization , 1996, Ann. Oper. Res..
[164] Daniel R. Greening,et al. Parallel simulated annealing techniques , 1990 .
[165] Sankar K. Pal,et al. Selection of Optimal Set of Weights in a Layered Network Using Genetic Algorithms , 1994, Inf. Sci..
[166] Ulrich Faigle,et al. Some Convergence Results for Probabilistic Tabu Search , 1992, INFORMS J. Comput..
[167] Marco Dorigo,et al. An Investigation of some Properties of an "Ant Algorithm" , 1992, PPSN.
[168] Pascal Van Hentenryck,et al. Constraint Satisfaction Using Constraint Logic Programming , 1992, Artif. Intell..
[169] J. Doll,et al. Quantum annealing: A new method for minimizing multidimensional functions , 1994, chem-ph/9404003.
[170] Emile H. L. Aarts,et al. The Design and Complexity of Exact Multilayered Perceptrons , 1991, Int. J. Neural Syst..
[171] Stefan Voß,et al. Capacitated minimum spanning trees: algorithms using intelligent search , 1995 .
[172] Colin R. Reeves,et al. Heuristics for scheduling a single machine subject to unequal job release times , 1995 .
[173] Joachim Stender,et al. Parallel Genetic Algorithms: Introduction and Overview of Current Research , 1993 .
[174] Yskandar Hamam,et al. Solving the part families problem in discrete-parts manufacture by simulated annealing , 1994 .
[175] A. Cangelosi,et al. Cell division and migration in a 'genotype' for neural networks (Cell division and migration in neural networks) , 1993 .
[176] John E. Angus,et al. Optimal mutation probability for genetic algorithms , 1995 .
[177] Juan C. Meza,et al. Do intelligent configuration search techniques outperform random search for large molecules , 1992 .
[178] Hiroyuki Nagasawa,et al. Complex random sample scheduling and its application to an N/M/F/F max problem , 1994 .
[179] S. Mitter,et al. Weak convergence of Markov chain sampling methods and annealing algorithms to diffusions , 1991 .
[180] Melanie Mitchell,et al. What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation , 1993, Machine Learning.
[181] M. N. Shanmukha Swamy,et al. Simulated Annealing and Tabu Search Algorithms for Multiway Graph Partition , 1992, J. Circuits Syst. Comput..
[182] Jonathan F. Bard,et al. The cutting path and tool selection problem in computer aided process planning , 1989 .
[183] Gerhard W. Dueck,et al. Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .
[184] Rex K. Kincaid. Minimizing distortion in truss structures: A comparison of simulated annealing and tabu search , 1993 .
[185] Laveen N. Kanal,et al. Asymmetric mean-field neural networks for multiprocessor scheduling , 1992, Neural Networks.
[186] Loren Paul Rees,et al. Using Neural Networks to Determine Internally-Set Due-Date Assignments for Shop Scheduling* , 1994 .
[187] Reinhard Männer,et al. On Steiner Trees and Genetic Algorithms , 1989, Parallelism, Learning, Evolution.
[188] E. Aarts,et al. Boltzmann machines for travelling salesman problems , 1989 .
[189] Marimuthu Palaniswami,et al. Comparison of Heuristic Algorithms for the Degree Constrained Minimum Spanning Tree , 1996 .
[190] An-Hsiang Wang,et al. Solving Location-allocation Problems with Rectilinear Distances by Simulated Annealing , 1994 .
[191] Marco Dorigo,et al. Genetic Algorithms: A New Approach to the Timetable Problem , 1992 .
[192] R. Srichander,et al. EFFICIENT SCHEDULES FOR SIMULATED ANNEALING , 1995 .
[193] Zbigniew Michalewicz,et al. A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem , 1991, INFORMS J. Comput..
[194] J. Barnes,et al. Solving the job shop scheduling problem with tabu search , 1995 .
[195] Laura Painton,et al. Genetic algorithms in optimization of system reliability. , 1995 .
[196] Uday R. Kulkarni,et al. Dynamic grouping of parts in flexible manufacturing systems : a self-organizing neural networks approach , 1995 .
[197] Wolfgang Banzhaf,et al. Evolution and Biocomputation , 1995, Lecture Notes in Computer Science.
[198] Alfred Taudes,et al. Implementing Branch-and-Bound Algorithms on a Cluster of Workstations — A Survey, Some New Results and Open Problems , 1991 .
[199] D. Barrios,et al. Conditions for convergence of genetic algorithms through walsh series , 1994 .
[200] Eric Backer,et al. Finding point correspondences using simulated annealing , 1995, Pattern Recognit..
[201] Andrew B. Kahng,et al. Old Bachelor Acceptance: A New Class of Non-Monotone Threshold Accepting Methods , 1995, INFORMS J. Comput..
[202] Khalil S. Hindi,et al. Detailed scheduling of batch production in a cell with parallel facilities and common renewable resources , 1995 .
[203] Robert F. Port,et al. Fractally configured neural networks , 1991, Neural Networks.
[204] Andrzej Cichocki,et al. Neural networks for optimization and signal processing , 1993 .
[205] Fred W. Glover,et al. A study of diversification strategies for the quadratic assignment problem , 1994, Comput. Oper. Res..
[206] Edward W. Felten,et al. Large-step markov chains for the TSP incorporating local search heuristics , 1992, Oper. Res. Lett..
[207] J. Paulli,et al. A Computational Comparison of Simulated Annealing and Tabu Search Applied to the Quadratic Assignment Problem , 1993 .
[208] Alessandro De Gloria,et al. Block placement with a Boltzmann Machine , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[209] Fred W. Glover. Optimization by ghost image processes in neural networks , 1994, Comput. Oper. Res..
[210] E. Baum. Towards practical `neural' computation for combinatorial optimization problems , 1987 .
[211] Kris Vasudevan,et al. A comparison of several cooling schedules for simulated annealing implemented on a residual statics problem , 1993 .
[212] Youssef Saab,et al. A Fast and Robust Network Bisection Algorithm , 1995, IEEE Trans. Computers.
[213] A. R. Saha,et al. Implementation of a heuristic method for standard cell placement , 1993 .
[214] R. Rosner,et al. Optimization algorithms: simulated annealing and neural network processing , 1986 .
[215] Darrell Whitley,et al. A genetic algorithm tutorial , 1994, Statistics and Computing.
[216] Mauro Dell'Amico,et al. A New Tabu Search Approach to the 0–1 Equicut Problem , 1996 .
[217] Andreas Drexl,et al. Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling , 1996 .
[218] Emile H. L. Aarts,et al. A parallel 2-opt algorithm for the Traveling Salesman Problem , 1995, Future Gener. Comput. Syst..
[219] Madabhushi Raghavachari,et al. A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions , 1993, Comput. Oper. Res..
[220] Marius Sinclair,et al. Comparison of the performance of modern heuristics for combinatorial optimization on real data , 1993, Comput. Oper. Res..
[221] Attahiru Sule Alfa,et al. A REVISED SIMULATED ANNEALING AND CLUSTER-FIRST ROUTE-SECOND ALGORITHM APPLIED TO THE VEHICLE ROUTING PROBLEM , 1993 .
[222] Yuval Davidor,et al. Genetic algorithms and robotics , 1991 .
[223] R. Logendran,et al. Manufacturing cell formation in the presence of lot splitting and multiple units of the same machine , 1995 .
[224] Jorge Haddock,et al. Simulation optimization using simulated annealing , 1992 .
[225] Jadranka Skorin-Kapov,et al. Tabu Search Applied to the Quadratic Assignment Problem , 1990, INFORMS J. Comput..
[226] Thomas Bäck,et al. A Survey of Evolution Strategies , 1991, ICGA.
[227] Manuel Laguna,et al. Applying Tabu Search To The Two-Dimensional Ising Spin Glass , 1995 .
[228] Douglas D. Gemmill. Solution to the assortment problem via the genetic algorithm , 1992 .
[229] Irène Charon,et al. Mixing Different Components of Metaheuristics , 1996 .
[230] Éric D. Taillard. Recherches itératives dirigées parallèles , 1993 .
[231] Darrell Whitley,et al. Scheduling problems and traveling salesman: the genetic edge recombination , 1989 .
[232] Peter Ross,et al. Some Combinatorial Landscapes on which a Genetic Algorithm Outperforms Other Stochastic Iterative Methods , 1995, Evolutionary Computing, AISB Workshop.
[233] Gunar E. Liepins,et al. A New Approach on the Traveling Salesman Problem by Genetic Algorithms , 1993, ICGA.
[234] Robert P. Sheridan,et al. Using a Genetic Algorithm To Suggest Combinatorial Libraries , 1995, J. Chem. Inf. Comput. Sci..
[235] Zbigniew Michalewicz,et al. GENOCOP: a genetic algorithm for numerical optimization problems with linear constraints , 1996, CACM.
[236] Composite stock cutting through simulated annealing , 1992 .
[237] Chuen-Lung Chen,et al. Simulated annealing and the mapping problem: A computational study , 1994, Comput. Oper. Res..
[238] John J. Grefenstette,et al. Using Genetic Algorithms for Concept Learning , 2004, Machine Learning.
[239] Emile H. L. Aarts,et al. Local search in coding theory , 1992, Discret. Math..
[240] Ehl Emile Aarts,et al. A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .
[241] Christian Prins,et al. Deux problèmes d'ordonnancement en télécommunications par satellite , 1991 .
[242] Li Lin,et al. Effective job shop scheduling through active chain manipulation , 1995, Comput. Oper. Res..
[243] Munirpallam A. Venkataramanan,et al. Genetic search and the dynamic facility layout problem , 1994, Comput. Oper. Res..
[244] Sally C. Brailsford,et al. The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared , 1995, CP.
[245] Stefan Voß,et al. Solving Quadratic Assignment Problems Using the Reverse Elimination Method , 1995 .
[246] Michel Gendreau,et al. LOCATING A TRANSIT LINE USING TABU SEARCH , 1996 .
[247] Karl Heinz Hoffmann,et al. The optimal simulated annealing schedule for a simple model , 1990 .
[248] Sunderesh S. Heragu. Modeling the machine layout problem , 1990 .
[249] A. Hertz,et al. A new heuristic method for the flow shop sequencing problem , 1989 .
[250] Bozena Kaminska,et al. Functional synthesis of digital systems with TASS , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[251] H. Mühlenbein,et al. Gene Pool Recombination in Genetic Algorithms , 1996 .
[252] Stefan Voß,et al. Technical Note - On the Cancellation Sequence Method of Tabu Search , 1991, INFORMS J. Comput..
[253] Yash P. Gupta,et al. Applications of neural networks in manufacturing management systems , 1994 .
[254] S. Sahu,et al. Stochastic assembly line balancing using simulated annealing , 1994 .
[255] Dietmar Kunz,et al. Channel assignment for cellular radio using simulated annealing , 1993 .
[256] J. K. Lenstra,et al. Local Search in Combinatorial Optimisation. , 1997 .
[257] Joachim Stender,et al. Parallel Genetic Algorithms: Theory and Applications , 1993 .
[258] Shouhong Wang,et al. A neural network technique in modeling multiple criteria multiple person decision making , 1994, Comput. Oper. Res..
[259] Derek Smith,et al. Bin Packing with Adaptive Search , 1985, ICGA.
[260] Cihan H. Dagli,et al. Genetic neuro-scheduler for job shop scheduling , 1993 .
[261] L. W. Jacobs,et al. Note: A local-search heuristic for large set-covering problems , 1995 .
[262] Alain Hertz,et al. Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs , 1995, J. Heuristics.
[263] Fred W. Glover,et al. Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms) , 1994, Discret. Appl. Math..
[264] Bart L. M. Happel,et al. Design and evolution of modular neural network architectures , 1994, Neural Networks.
[265] Jonathan Rose,et al. Parallel standard cell placement algorithms with quality equivalent to simulated annealing , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[266] Katsumi Morikawa,et al. Neural network approach for minimizing the makespan of the general job-shop , 1994 .
[267] Chandrasekharan Rajendran,et al. A simulated annealing heuristic for scheduling in a flowshop with bicriteria , 1994 .
[268] F. Glover. HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS , 1977 .
[269] Mitsuru Kuroda,et al. Improvement on the computational efficiency of inverse queueing network analysis , 1994 .
[270] Sadiq M. Sait,et al. Genetic scheduling of task graphs , 1994 .
[271] GloverFred,et al. Genetic algorithms and tabu search , 1995 .
[272] Peter T. Cummings,et al. Scheduling of multiple products on parallel units with tardiness penalties using simulated annealing , 1995 .
[273] K. Dowsland. Some experiments with simulated annealing techniques for packing problems , 1993 .
[274] Imtiaz Ahmad,et al. On the m-Way Graph Partitioning Problem , 1995, Comput. J..
[275] R. H. J. M. Otten,et al. The Annealing Algorithm , 1989 .
[276] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[277] P. Hajela,et al. GENETIC ALGORITHMS IN OPTIMIZATION PROBLEMS WITH DISCRETE AND INTEGER DESIGN VARIABLES , 1992 .
[278] Lawrence J. Fogel,et al. Artificial Intelligence through Simulated Evolution , 1966 .
[279] Laurent Hérault. Réseaux de neurones récursifs pour l'optimisation combinatoire : application à la théorie des graphes et à la vision par ordinateur , 1991 .
[280] Pierre Roussel-Ragot,et al. Error-Free Parallel Implementation of Simulated Annealing , 1990, PPSN.
[281] Roger L. Wainwright,et al. Designing telecommunications networks using genetic algorithms and probabilistic minimum spanning trees , 1994, SAC '94.
[282] Michael Chester,et al. Neural networks - a tutorial , 1993 .
[283] Yuval Lirov,et al. Computer aided neural network engineering , 1992, Neural Networks.
[284] Andrew W. Shogan,et al. Semi-greedy heuristics: An empirical study , 1987 .
[285] Z. Michalewicz. Non-standard methods in evolutionary computation , 1994 .
[286] Kishi Mitsuo,et al. An optimization technique with neural networks and its application to a ferry routing , 1990 .
[287] Jun Wang,et al. On the asymptotic Properties of Recurrent Neural Networks for Optimization , 1991, Int. J. Pattern Recognit. Artif. Intell..
[288] J. Ben Atkinson,et al. A Greedy Look-ahead Heuristic for Combinatorial Optimization: An Application to Vehicle Scheduling with Time Windows , 1994 .
[289] Veljko Milutinovic,et al. Neural Networks: Concepts, Applications, and Implementations , 1991 .
[290] Jean-Luc Lutton,et al. A Parallel Simulated Annealing Algorithm , 1993, Parallel Comput..
[291] J. G. Taylor,et al. Mathematical Approaches to Neural Networks , 1993 .
[292] Jadranka Skorin-Kapov,et al. Mapping Tasks to Processors to Minimize Communication Time in a Multiprocessor System , 1995 .
[293] Carsten Peterson,et al. Parallel Distributed Approaches to Combinatorial Optimization: Benchmark Studies on Traveling Salesman Problem , 1990, Neural Computation.
[294] Fred Glover. New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems , 1992, Computer Science and Operations Research.
[295] Satoru Hashiba,et al. Heuristic and Simulated Annealing Approaches to PCB Assembly Setup Reduction , 1992, PROLAMAT.
[296] S. Rees,et al. Criteria for an optimum simulated annealing schedule for problems of the travelling salesman type , 1987 .
[297] Jean-Yves Potvin,et al. A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraints , 1994, Comput. Oper. Res..
[298] James P. Kelly,et al. Large-scale controlled rounding using tabu search with strategic oscillation , 1993, Ann. Oper. Res..
[299] Terry L. Friesz,et al. A Simulated Annealing Approach to the Network Design Problem with Variational Inequality Constraints , 1992, Transp. Sci..
[300] J. A. Bland,et al. Tabu search and design optimization , 1991, Comput. Aided Des..
[301] Wing Shing Wong,et al. Matrix representation and gradient flows for NP-hard problems , 1995 .
[302] Stefan Voß. Dynamic tabu search strategies for the traveling purchaser problem , 1996, Ann. Oper. Res..
[303] Duc Truong Pham,et al. A knowledge-based system for optimizing workplace layouts using a genetic algorithm , 1992 .
[304] R Garduño-Juárez,et al. The multiple-minima problem in small peptides revisited. The Threshold Accepting approach. , 1992, Journal of biomolecular structure & dynamics.
[305] S. Arunkumar,et al. Randomized Heuristics for the Mapping Problem , 1992, Int. J. High Speed Comput..
[306] M. Resende,et al. A GRASP for graph planarization , 1997 .
[307] Mats Bengtsson,et al. Using the potts glass for solving the clustering problem , 1995, Int. J. Neural Syst..
[308] Jun Wang,et al. Multicriteria order acceptance decision support in over-demanded job shops: A neural network approach , 1994 .
[309] Arun Jagota,et al. Approximating maximum clique with a Hopfield network , 1995, IEEE Trans. Neural Networks.
[310] H. Ku,et al. An evaluation of simulated annealing for batch process scheduling , 1991 .
[311] Alex Van Breedam,et al. An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-relatezd, customer-related, and time-related constraints , 1994 .
[312] Heinz Mühlenbein,et al. Analysis of Selection, Mutation and Recombination in Genetic Algorithms , 1995, Evolution and Biocomputation.
[313] Panos M. Pardalos,et al. Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP , 1995, IRREGULAR.
[314] D.A. Beyer,et al. Tabu learning: a neural network search method for solving nonconvex optimization problems , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.
[315] Heinrich Braun,et al. On Solving Travelling Salesman Problems by Genetic Algorithms , 1990, PPSN.
[316] Imtiaz Ahmad,et al. Task assignment using a problem-space genetic algorithm , 1995, Concurr. Pract. Exp..
[317] B. Kröger. Guillotineable bin packing: A genetic approach , 1995 .
[318] Fred Glover,et al. An Overview of Tabu Search Approaches to Production Scheduling Problems , 1995 .
[319] Eli Gafni,et al. A Distributed Implementation of Simulated Annealing , 1989, J. Parallel Distributed Comput..
[320] G. Sheblé,et al. Refined genetic algorithm-economic dispatch example , 1995 .
[321] Berndt Müller,et al. Neural networks: an introduction , 1990 .
[322] Jadranka Skorin-Kapov,et al. A connectionist approach to the quadratic assignment problem , 1992, Comput. Oper. Res..
[323] Rina Dechter,et al. Dead-End Driven Learning , 1994, AAAI.
[324] Yoshiyasu Takefuji,et al. Job-shop scheduling based on modified tank-hopfield linear programming networks , 1994 .
[325] Éric D. Taillard,et al. Robust taboo search for the quadratic assignment problem , 1991, Parallel Comput..
[326] Rick L. Wilson. Ranking College Football Teams: A Neural Network Approach , 1995 .
[327] Emile H. L. Aarts,et al. Genetic Algorithms in Coding Theory - A Table for A3(n, d) , 1993, Discret. Appl. Math..
[328] James C. Bean,et al. Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..
[329] Emanuel Falkenauer,et al. A genetic algorithm for job shop , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[330] Jean Walrand,et al. Simulated Annealing, Random Search, MultiStart or SAD? , 1987 .
[331] Rob A. Rutenbar,et al. Simulated annealing algorithms: an overview , 1989, IEEE Circuits and Devices Magazine.
[332] K. Hindi. Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search , 1995 .
[333] R. Burkard,et al. Heuristics for biquadratic assignment problems and their computational comparison , 1995 .
[334] C. Peterson,et al. Solving optimization problems with mean field methods , 1993 .
[335] Richard Durbin,et al. An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.
[336] Volker Nissen,et al. Solving the quadratic assignment problem with clues from nature , 1994, IEEE Trans. Neural Networks.
[337] Roberto Battiti,et al. Training neural nets with the reactive tabu search , 1995, IEEE Trans. Neural Networks.
[338] R. Vidal. Applied simulated annealing , 1993 .
[339] David Abramson,et al. A very high speed architecture for simulated annealing , 1992, Computer.
[340] Johann L. Hurink,et al. Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .
[341] Tomoharu Takada,et al. A neural network system for solving an assortment problem in the steel industry , 1995, Ann. Oper. Res..
[342] Fumihiro Maruyama,et al. A logical framework for constraint programming , 1994 .
[343] Tsong Yueh Chen,et al. Performance and Area Optimization of VLSI Systems Using Genetic Algorithms , 1995, VLSI Design.
[344] Zbigniew Michalewicz. A Hierarchy of Evolution Programs , 1996 .
[345] D. Costa,et al. A tabu search algorithm for computing an operational timetable , 1994 .
[346] Bernard W. Silverman,et al. Temperature schedules for simulated annealing , 1994 .
[347] C.-L. Chen,et al. A simulated annealing solution to the cell formation problem , 1995 .
[348] H. Kitano. Neurogenetic learning: an integrated method of designing and training neural networks using genetic algorithms , 1994 .
[349] Stefan Voß,et al. Tabu Search: Applications and Prospects , 1993 .
[350] James E. Moore,et al. LINEAR PROGRAMMING AND RECURRENT ASSOCIATIVE MEMORIES , 1992 .
[351] Peter J. Fleming,et al. An Overview of Evolutionary Algorithms in Multiobjective Optimization , 1995, Evolutionary Computation.
[352] Simon Y. Foo,et al. Divide and conquer orthogonality principle for parallel optimizations in TSP , 1995, Neurocomputing.
[353] Roger L. Wainwright,et al. Solving combinatorial optimization problems using parallel simulated annealing and parallel genetic algorithms , 1992, SAC '92.
[354] Jan Karel Lenstra,et al. Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..
[355] Bruce E. Rosen,et al. Genetic Algorithms and Very Fast Simulated Reannealing: A comparison , 1992 .
[356] Paul Molitor. Layer assignment by simulated annealing , 1985 .
[357] Kenneth J. Supowit,et al. Simulated Annealing Without Rejected Moves , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[358] Mitsuo Gen,et al. Crossover on intensive search and traveling salesman problem , 1994 .
[359] Robert E. Dorsey,et al. Genetic algorithms for estimation problems with multiple optima , 1995 .
[360] Laurene V. Fausett,et al. Fundamentals Of Neural Networks , 1993 .
[361] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[362] Akio Ogihara,et al. Asymmetric Neural Network and Its Application to Knapsack Problem , 1995 .
[363] Jung-Hua Chou,et al. New approach for the ordering of gate permutation in one-dimensional logic arrays , 1995 .
[364] Herbert Kopfer,et al. Konzepte genetischer Algorithmen und ihre Anwendung auf das Frachtoptimierungsproblem im gewerblichen Güterfernverkehr , 1992 .
[365] S. Selcuk Erenguc,et al. A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows , 1994 .
[366] Geoffrey C. Fox,et al. Allocating data to distributed-memory multiprocessors by genetic algorithms , 1994, Concurr. Pract. Exp..
[367] Richard W. Eglese,et al. A tabu search based heuristic for arc routing with a capacity constraint and time deadline , 1996 .
[368] O. Fuentes,et al. Generic algorithms: what fitness scaling is optimal? , 1993 .
[369] G. Anandalingam,et al. Genetic algorithm based approach to bi-level linear programming , 1994 .
[370] David K. Smith,et al. The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..
[371] Eam Khwang Teoh,et al. Self-organizing Hopfield network for attributed relational graph matching , 1995, Image Vis. Comput..
[372] J. P. Kelly,et al. Tabu search for the multilevel generalized assignment problem , 1995 .
[373] L. Darrell Whitley,et al. Genetic algorithms and neural networks: optimizing connections and connectivity , 1990, Parallel Comput..
[374] S. S. Wilson,et al. Teaching network connectivity using simulated annealing on a massively parallel processor , 1991, Proc. IEEE.
[375] Alain Hertz,et al. Finding a feasible course schedule using Tabu search , 1992, Discret. Appl. Math..
[376] Cheng-Yan Kao,et al. A Genetic Algorithm Approach for Set Covering Problems , 1994, International Conference on Evolutionary Computation.
[377] Dk Smith,et al. Simulated annealing for the permutation flowshop problem , 1991 .
[378] Michael D. Vose,et al. Isomorphisms algorithms of genetic , 2002 .
[379] Michel Gendreau,et al. A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..
[380] Ranga Vemuri,et al. MCM layer assignment using genetic search , 1994 .
[381] Kazuhiro Saitou,et al. Genetic algorithms as an approach to configuration and topology design , 1994, DAC 1993.
[382] Alan Burns,et al. Generating feasible cyclic schedules , 1995 .
[383] Ron Sharpe,et al. Solution of the facilities layout problem by simulated annealing , 1986 .
[384] T. Narendran,et al. A genetic algorithm approach to the machine-component grouping problem with multiple objectives , 1992 .
[385] T. Friesz,et al. The multiobjective equilibrium network design problem revisited: A simulated annealing approach , 1993 .
[386] Jim Smith,et al. An Adaptive Poly-Parental Recombination Strategy , 1995, Evolutionary Computing, AISB Workshop.
[387] Michael J. Shaw,et al. Joint Lot Sizing and Sequencing with Genetic Algorithms for Scheduling: Evolving the Chromosome Structure , 1993, ICGA.
[388] Eugene C. Freuder,et al. Partial Constraint Satisfaction , 1989, IJCAI.
[389] H. Szu. Fast simulated annealing , 1987 .
[390] Jun Wang,et al. A deterministic annealing neural network for convex programming , 1994, Neural Networks.
[391] L. C. Jain,et al. Hybrid connectionist systems in research and teaching , 1995 .
[392] Edward W. Felten,et al. Large-Step Markov Chains for the Traveling Salesman Problem , 1991, Complex Syst..
[393] Jean-Yves Potvin,et al. Genetic Algorithms for the Traveling Salesman Problem , 2005 .
[394] Matevž Kovačič,et al. Timetable construction with Markovian neural network , 1993 .
[395] Bernard Angéniol,et al. Self-organizing feature maps and the travelling salesman problem , 1988, Neural Networks.
[396] Jun Gu,et al. Local search for satisfiability (SAT) problem , 1993, IEEE Trans. Syst. Man Cybern..
[397] Kiyoshi Takahashi,et al. The Scheduling of the Parameters in Hopfield Neural Networks with Fuzzy Control , 1994 .
[398] Peter M. A. Sloot,et al. Comparison of vector and parallel implementations of the simulated annealing algorithm , 1995, Future generations computer systems.
[399] Wpm Wim Nuijten,et al. Time and resource constrained scheduling : a constraint satisfaction approach , 1994 .
[400] Carsten Peterson,et al. "Teachers and Classes" with Neural Networks , 1991, Int. J. Neural Syst..
[401] Simon Lin,et al. A new methodology of simulated annealing for the optimisation problems , 1994 .
[402] Mauro Dell'Amico,et al. Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..
[403] Alan K. Mackworth. The Logic of Constraint Satisfaction , 1991, Artif. Intell..
[404] Mark A. Franklin,et al. Parallel Simulated Annealing using Speculative Computation , 1991, IEEE Trans. Parallel Distributed Syst..
[405] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..
[406] Ibrahim H. Osman,et al. Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches , 1995 .
[407] Monica Cuppini,et al. A genetic algorithm for channel assignment problems , 2010, Eur. Trans. Telecommun..
[408] Svatopluk Poljak. Integer Linear Programs and Local Search for Max-Cut , 1995, SIAM J. Comput..
[409] Eugene L. Lawler,et al. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .
[410] David A. Bell,et al. The use of simulated annealing for clustering data in databases , 1990, Inf. Syst..
[411] O. Catoni,et al. Exponential triangular cooling schedules for simulated annealing algorithms : A case study , 1992 .
[412] M. D. Kidwell,et al. Using Genetic Algorithms to Schedule Distributed Tasks on a Bus-Based System , 1993, International Conference on Genetic Algorithms.
[413] Jae Young Choi,et al. A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights , 1995, Comput. Oper. Res..
[414] L. Darrell Whitley,et al. Test driving three 1995 genetic algorithms: New test functions and geometric matching , 1995, J. Heuristics.
[415] Ron Shonkwiler,et al. Parallel Genetic Algorithms , 1993, ICGA.
[416] Valentin Todorov. Computing the Minimum Covariance Determinant Estimator (MCD) by simulated annealing , 1992 .
[417] Andreas Drexl,et al. Academic course scheduling under workload and changeover constraints , 1993 .
[418] Clifford Lau,et al. Neural Networks: Theoretical Foundations and Analysis , 1991 .
[419] D J Stockton,et al. Aggregate Production Planning Using Genetic Algorithms , 1995 .
[420] X. Xu,et al. Effective neural algorithms for the traveling salesman problem , 1991, Neural Networks.
[421] Wen-Chyuan Chiang,et al. Simulated annealing and tabu search approaches to unidirectional flowpath design for Automated Guided Vehicle Systems , 1994, Ann. Oper. Res..
[422] Roberto Battiti,et al. Vector Quantization with the Reactive Tabu Search , 1996 .
[423] Bruce L. Golden,et al. A hierarchical strategy for solving traveling salesman problems using elastic nets , 1995, J. Heuristics.
[424] Chee-Kit Looi,et al. Neural network methods in combinatorial optimization , 1992, Comput. Oper. Res..
[425] Peter K. Sharpe,et al. Genetic algorithms for generating minimum path configurations , 1995, Microprocess. Microsystems.
[426] Pei-Yung Hsiao,et al. Solving System Partitioning Problem using a Massively Parallel Bio-Computing Network , 1994, IFIP Congress.
[427] Xin Yao,et al. Simulated annealing with extended neighbourhood , 1991, Int. J. Comput. Math..
[428] A. Cuticchia,et al. The use of simulated annealing in chromosome reconstruction experiments based on binary scoring. , 1992, Genetics.
[429] Paul Juell,et al. Neural Networks for Selective Vehicle Routing Heuristics , 1990, INFORMS J. Comput..
[430] Stephen Grossberg,et al. A massively parallel architecture for a self-organizing neural pattern recognition machine , 1988, Comput. Vis. Graph. Image Process..
[431] Hans-Michael Voigt,et al. Soft Genetic Operators in Evolutionary Algorithms , 1995, Evolution and Biocomputation.
[432] Kate Juliff,et al. A Multi-chromosome Genetic Algorithm for Pallet Loading , 1993, International Conference on Genetic Algorithms.
[433] Olivier C. Martin,et al. Partitioning of unstructured meshes for load balancing , 1995, Concurr. Pract. Exp..
[434] Michel Gendreau,et al. A tabu search procedure for multicommodity location/allocation with balancing requirements , 1992, Ann. Oper. Res..
[435] Lawrence Davis,et al. Shall We Repair? Genetic AlgorithmsCombinatorial Optimizationand Feasibility Constraints , 1993, ICGA.
[436] Ibrahim Hassan Osman,et al. Metastrategy : simulated annealing and tabu search for combinatorial optimization problems , 1991 .
[437] Daniele Vigo,et al. Heuristic Algorithms for Single Processor Scheduling with Earliness and Flow Time Penalties , 1996 .
[438] Emile H. L. Aarts,et al. Exact Classification with Two-Layered Perceptrons , 1992, Int. J. Neural Syst..
[439] S. T. Fischer. A Note on the Complexity of Local Search Problems , 1995, Inf. Process. Lett..
[440] Jonathan F. Bard,et al. Flight Scheduling and Maintenance Base Planning , 1989 .
[441] Jadranka Skorin-Kapov,et al. Extensions of a tabu search adaptation to the quadratic assignment problem , 1994, Comput. Oper. Res..
[442] Peter M. Hooper. Nearly orthogonal randomized designs , 1993 .
[443] Richard W. Prager,et al. Limitations of neural networks for solving traveling salesman problems , 1995, IEEE Trans. Neural Networks.
[444] Hironori Hirata,et al. Hierarchical algorithm for a partition problem using simulated annealing: application to placement in VLSI layout , 1991 .
[445] Jean-Luc Lutton,et al. Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem , 1986 .
[446] R. Boggia,et al. Genetic algorithms as a strategy for feature selection , 1992 .
[447] Jürgen Dorn,et al. Reactive scheduling: improving the robustness of schedules and restricting the effects of shop floor disturbances by fuzzy reasoning , 1995, Int. J. Hum. Comput. Stud..
[448] G. Venkataraman,et al. Spin glass, the travelling salesman problem, neural networks and all that , 1991 .
[449] Takeshi Yamada,et al. Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search , 1996 .
[450] S. Subramanian,et al. Genetic algorithm for embedding a complete graph in a hypercube with a VLSI application , 1994, Microprocess. Microprogramming.
[451] Tetsuya Higuchi,et al. An efficient algorithm for solving optimization problems on Hopfield-type neural networks , 1995, Systems and Computers in Japan.
[452] Godfrey A. Walters,et al. OPTIMAL LAYOUT OF TREE NETWORKS USING GENETIC ALGORITHMS , 1993 .
[453] Manuel Graña,et al. Solving Satisfiability Via Boltzmann Machines , 1993, IEEE Trans. Pattern Anal. Mach. Intell..
[454] Emile H. L. Aarts,et al. Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.
[455] R. Bucy,et al. Decision tree design by simulated annealing , 1993 .
[456] R. Storer,et al. New search spaces for sequencing problems with application to job shop scheduling , 1992 .
[457] David Abramson,et al. A comparison of two methods for solving 0–1 integer programs using a general purpose simulated annealing algorithm , 1996, Ann. Oper. Res..
[458] John E. Beasley,et al. A delaunay triangulation-based heuristic for the euclidean steiner problem , 1994, Networks.
[459] Claude-Nicolas Fiechter,et al. A Parallel Tabu Search Algorithm for Large Traveling Salesman Problems , 1994, Discret. Appl. Math..
[460] Fred W. Glover,et al. Tabu Thresholding: Improved Search by Nonmonotonic Trajectories , 1995, INFORMS J. Comput..
[461] Fred Glover,et al. Probabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems , 1996 .
[462] William L. Goffe,et al. SIMANN: FORTRAN module to perform Global Optimization of Statistical Functions with Simulated Annealing , 1992 .
[463] Stefan Voß,et al. Tabu search techniques for the quadratic semiassignment problem , 1992 .
[464] B. Malakooti,et al. Feedforward artificial neural networks for solving discrete multiple criteria decision making problems , 1994 .
[465] J. Ramanujam,et al. Mapping combinatorial optimization problems onto neural networks , 1995, Inf. Sci..
[466] Alan K. Mackworth. Constraint Satisfaction , 1985 .
[467] Graeme C. Dandy,et al. Genetic algorithms compared to other techniques for pipe optimization , 1994 .
[468] C. P. Ravikumar,et al. Heuristic and neural algorithms for mapping tasks to a reconfigurable array , 1995, Microprocess. Microprogramming.
[469] H. P. Stehouwer,et al. Neural Networks and the Travelling Salesman Problem , 1993 .
[470] Emile H. L. Aarts,et al. Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.
[471] Youshen Xia,et al. Neural network for solving linear programming problems with bounded variables , 1995, IEEE Trans. Neural Networks.
[472] Wen-Chyuan Chiang,et al. Simulated annealing for machine layout problems in the presence of zoning constraints , 1992 .
[473] Paolo Brandimarte,et al. Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..
[474] Francisco J. Vico,et al. Use of Genetic Algorithms in Neural Networks Definition , 1991, IWANN.
[475] Ingo Althöfer,et al. On the convergence of “Threshold Accepting” , 1991 .
[476] Christian Mazza. Parallel Simulated Annealing , 1992, Random Struct. Algorithms.
[477] Frank Werner,et al. On the heuristic solution of the permutation flow shop problem by path algorithms , 1993, Comput. Oper. Res..
[478] Chang-Sung Jeong,et al. Fast parallel simulated annealing for traveling salesman problem on SIMD machines with linear interconnections , 1991, Parallel Comput..
[479] Abraham Kandel,et al. Efficient Genetic Algorithms for Training Layered Feedback Neural Networks , 1994, Inf. Sci..
[480] Heinz Mühlenbein,et al. New solutions to the mapping problem of parallel systems: The evolution approach , 1987, Parallel Comput..
[481] Shengwei Zhang,et al. Second-order neural nets for constrained optimization , 1992, IEEE Trans. Neural Networks.
[482] Jun Wang,et al. Characterization of training errors in supervised learning using gradient-based rules , 1993, Neural Networks.
[483] Khaled S. Al-Sultan,et al. A Tabu search approach to the clustering problem , 1995, Pattern Recognit..
[484] Youssef Saab,et al. Combinatorial optimization by stochastic evolution , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[485] S. Subramanian,et al. Genetic algorithm for test scheduling with different objectives , 1994, Integr..
[486] R. Mathar,et al. On global optimization in two-dimensional scaling , 1993 .
[487] Chris N. Potts,et al. Unrelated parallel machine scheduling using local search , 1994 .
[488] Zbigniew Michalewicz,et al. Evolutionary Computation and Heuristics , 1996 .
[489] Ehl Emile Aarts,et al. Neural networks and production planning , 1991 .
[490] Toshihide Ibaraki,et al. Simulated annealing and tabu search , 1997 .
[491] Peter F. Stadler,et al. Correlation in Landscapes of Combinatorial Optimization Problems , 1992 .
[492] U. Faigle,et al. Note on the convergence of simulated annealing algorithms , 1991 .
[493] David M. Levine,et al. A Genetic Algorithm for the Set Partitioning Problem , 1993, International Conference on Genetic Algorithms.
[494] Joseph W. Goodman,et al. On the power of neural networks for solving hard problems , 1990, J. Complex..
[495] Tao Sun,et al. A fast optimization method based on a hierarchical strategy for the travelling salesman problem , 1993 .
[496] Wen-Chyuan Chiang,et al. Simulated annealing metaheuristics for the vehicle routing problem with time windows , 1996, Ann. Oper. Res..
[497] Deniz Yuret. From Genetic Algorithms to Efficient Optimization , 1994 .
[498] Ranga Vemuri,et al. Genetic algorithm for MCM partitioning , 1994 .
[499] Jovan B. Popovic. VEHICLE ROUTING IN THE CASE OF UNCERTAIN DEMAND: A BAYESIAN APPROACH. , 1995 .
[500] R. Martí. An Aggressive Search Procedure for the Bipartite Drawing Problem , 1996 .
[501] Mauricio G. C. Resende,et al. A GRASP for satisfiability , 1993, Cliques, Coloring, and Satisfiability.
[502] S. Wu,et al. GENETIC ALGORITHMS FOR NONLINEAR MIXED DISCRETE-INTEGER OPTIMIZATION PROBLEMS VIA META-GENETIC PARAMETER OPTIMIZATION , 1995 .
[503] Ronald L. Rardin,et al. Paroid Search: Generic Local Combinatorial Optimization , 1993, Discret. Appl. Math..
[504] Helge J. Ritter,et al. Self-organizing maps: Local competition and evolutionary optimization , 1994, Neural Networks.
[505] Richard W. Eglese,et al. Simulated annealing: A tool for operational research , 1990 .
[506] Dana S. Richards,et al. Distributed genetic algorithms for the floorplan design problem , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[507] F. Glover,et al. Bandwidth packing: a tabu search approach , 1993 .
[508] Vicente Valls,et al. A Modified Tabu Thresholding Approach for the Generalised Restricted Vertex Colouring Problem , 1996 .
[509] T. L. Ward,et al. Solving Quadratic Assignment Problems by ‘Simulated Annealing’ , 1987 .
[510] L. Darrell Whitley,et al. Serial and Parallel Genetic Algorithms as Function Optimizers , 1993, ICGA.
[511] Larry L. Schumaker,et al. Computing optimal triangulations using simulated annealing , 1993, Comput. Aided Geom. Des..
[512] Stefan Voß,et al. A Star-Shaped Diversification Approach in Tabu Search , 1996 .
[513] Simon Haykin,et al. Neural Networks: A Comprehensive Foundation , 1998 .
[514] J. Błażewicz,et al. A local search approach for two-dimensional irregular cutting , 1995 .
[515] Stella Sofianopoulou,et al. A queueing network application to a telecommunications distributed system , 1992 .
[516] Stephen P. Brooks,et al. A Hybrid Optimization Algorithm , 1995 .
[517] Marco Gori,et al. On the problem of local minima in recurrent neural networks , 1994, IEEE Trans. Neural Networks.
[518] Thomas Bäck,et al. An Overview of Evolutionary Algorithms for Parameter Optimization , 1993, Evolutionary Computation.
[519] Jun Wang. Analogue neural network for solving the assignment problem , 1992 .
[520] Carl Sechen,et al. Efficient and effective placement for very large circuits , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[521] Ramesh Sharda,et al. Bankruptcy prediction using neural networks , 1994, Decis. Support Syst..
[522] Marcus O'Connor,et al. Artificial neural network models for forecasting and decision making , 1994 .
[523] George Tambouratzis,et al. Optimising the clustering performance of a self-organising logic neural network with topology-preserving capabilities , 1994, Pattern Recognit. Lett..
[524] Gregor von Laszewski,et al. Partitioning a Graph with a Parallel Genetic Algorithm , 1990, PPSN.
[525] Chris N. Potts,et al. A comparison of local search methods for flow shop scheduling , 1996, Ann. Oper. Res..
[526] D J Willshaw,et al. A marker induction mechanism for the establishment of ordered neural mappings: its application to the retinotectal problem. , 1979, Philosophical transactions of the Royal Society of London. Series B, Biological sciences.
[527] James P. Ignizio,et al. A stochastic neural network for resource constrained scheduling , 1992, Comput. Oper. Res..
[528] Rina Dechter,et al. Experimental Evaluation of Preprocessing Algorithms for Constraint Satisfaction Problems , 1994, Artif. Intell..
[529] Gary M. Thompson. A simulated-annealing heuristic for shift scheduling using non-continuously available employees , 1996, Comput. Oper. Res..
[530] Carsten Peterson,et al. A New Method for Mapping Optimization Problems Onto Neural Networks , 1989, Int. J. Neural Syst..
[531] Peter T. Cummings,et al. Algorithmic efficiency of simulated annealing for heat exchanger network design , 1990 .
[532] R. Palmer,et al. Introduction to the theory of neural computation , 1994, The advanced book program.
[533] Ramesh Sharda,et al. Connectionist approach to time series prediction: an empirical test , 1992, J. Intell. Manuf..
[534] S. Macchietto,et al. Routing, scheduling and product mix optimisation by minimax algebra models : Process design , 1994 .
[535] Harvey J. Greenberg. Computational Testing: Why, How and How Much , 1990, INFORMS J. Comput..
[536] Gerrit K. Janssens,et al. A Simulated Annealing Postprocessor for the Vehicle Routing Problem , 1994 .
[537] Stephen Hurley,et al. A tabu search algorithm for frequency assignment , 1996, Ann. Oper. Res..
[538] Albert Jones,et al. A hybrid approach for real-time sequencing and scheduling , 1995 .
[539] Mahmut Parlar,et al. Technical Note - Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel , 1994, Transp. Sci..
[540] M. Gen,et al. Solving fuzzy assembly-line balancing problem with genetic algorithms , 1995 .
[541] Thomas Bäck,et al. The Interaction of Mutation Rate, Selection, and Self-Adaptation Within a Genetic Algorithm , 1992, PPSN.
[542] Tsuyoshi Kawaguchi,et al. Operation Scheduling by Annealed Neural Networks , 1995 .
[543] Mihalis Yannakakis,et al. How easy is local search? , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[544] Alain Hertz,et al. Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph , 1990, Comput. Oper. Res..
[545] Larry W. Jacobs,et al. A simulated annealing approach to the cyclic staff-scheduling problem , 1993 .
[546] Dimitris A. Karras,et al. An efficient constrained learning algorithm with momentum acceleration , 1995, Neural Networks.
[547] E. Mäkinen,et al. Genetic algorithms for drawing bipartite graphs , 1994 .
[548] David Connolly. An improved annealing scheme for the QAP , 1990 .
[549] Wolfgang Domschke,et al. Location and layout planning: a survey , 1996 .
[550] Gilbert Laporte,et al. Routing problems: A bibliography , 1995, Ann. Oper. Res..
[551] Jan Karel Lenstra,et al. A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..
[552] Kiichi Urahama,et al. Analog method for solving combinatorial optimization problems , 1994 .
[553] Alain Delchambre,et al. A genetic algorithm for bin packing and line balancing , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[554] Etsuji Tomita,et al. A randomized algorithm for finding a near-maximum clique and its experimental evaluations , 1994, Systems and Computers in Japan.
[555] Yao Xin,et al. Call routing by simulated annealing , 1995 .
[556] Robert H. Storer,et al. Problem and Heuristic Space Search Strategies for Job Shop Scheduling , 1995, INFORMS J. Comput..
[557] Teodor Gabriel Crainic,et al. Communication Issues in Designing Cooperative Multi-Thread Parallel Searches , 1996 .
[558] Nallan C. Suresh,et al. Performance of Selected Part‐Machine Grouping Techniques for Data Sets of Wide Ranging Sizes and Imperfection , 1994 .
[559] Emile H. L. Aarts,et al. Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.
[560] W ShoganAndrew. Semi-greedy heuristics , 1987 .
[561] Susan B. Spälti,et al. Modeling the satellite placement problem as a network flow problem with one side constraint , 1991 .
[562] Richard C. Dubes,et al. Experiments in projection and clustering by simulated annealing , 1989, Pattern Recognit..
[563] L. C. Stayton,et al. On the effectiveness of crossover in simulated evolutionary optimization. , 1994, Bio Systems.
[564] I. Osman,et al. Simulated annealing for permutation flow-shop scheduling , 1989 .
[565] Shaw K. Chen,et al. The comparative ability of self-organizing neural networks to define cluster structure , 1995 .
[566] Volker Nissen,et al. A modification of threshold accepting and its application to the quadratic assignment problem , 1995 .
[567] Pedro Meseguer,et al. Constraint Satisfaction Problems: An Overview , 1989, AI Commun..
[568] John Knox,et al. Tabu search performance on the symmetric traveling salesman problem , 1994, Comput. Oper. Res..
[569] William T. Scherer,et al. Combinatorial optimization techniques for spacecraft scheduling automation , 1994, Ann. Oper. Res..
[570] Jun Wang,et al. Neurally-inspired stochastic algorithm for determining multi-stage multi-attribute sampling inspection plans , 1991, J. Intell. Manuf..
[571] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[572] B. L. Fox. Random restarting versus simulated annealing , 1994 .
[573] Eduardo J. Dubuc. Bandwidth reduction by simulated annealing , 1994 .
[574] P. G. J. Lisboa. Neural Networks: Current Applications , 1992 .
[575] V. K. Koumousis,et al. Genetic Algorithms in Discrete Optimization of Steel Truss Roofs , 1994 .
[576] Reinhard Lüling,et al. Problem Independent Distributed Simulated Annealing and its Applications , 1993 .
[577] Edward Tsang,et al. A Generic Neural Network Approach For Constraint Satisfaction Problems , 1992 .
[578] Fred Glover,et al. Artificial intelligence, heuristic frameworks and tabu search , 1990 .
[579] Robert Azencott,et al. Simulated annealing : parallelization techniques , 1992 .
[580] Roberto Tadei,et al. Solving a real world project scheduling problem with a genetic approach , 1994 .
[581] K. B. Haley,et al. A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems , 1995 .
[582] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[583] S. E. Carlson,et al. Comparison of Three Non-derivative Optimization Methods with a Genetic Algorithm for Component Selection , 1994 .
[584] David M. Rocke,et al. Computable Robust Estimation of Multivariate Location and Shape in High Dimension Using Compound Estimators , 1994 .
[585] Mahesh Gupta,et al. Minimizing total intercell and intracell moves in cellular manufacturing: a genetic algorithm approach , 1995 .
[586] Chung-Yee Lee,et al. Solving a Class Scheduling Problem with a Genetic Algorithm , 1995, INFORMS J. Comput..
[587] L. Ingber,et al. Application of statistical mechanics methodology to term-structure bond-pricing models , 1991 .
[588] Lawrence Davis,et al. Genetic Algorithms and Simulated Annealing , 1987 .
[589] Erol Gelenbe,et al. Neural Networks: Advances and Applications II , 1991 .
[590] Fred W. Glover,et al. Least-cost network topology design for a new service , 1991, Ann. Oper. Res..
[591] Carsten Peterson,et al. Neural Networks for Optimization Problems with Inequality Constraints: The Knapsack Problem , 1993, Neural Computation.
[592] Youngohc Yoon,et al. A Comparison of Discriminant Analysis versus Artificial Neural Networks , 1993 .
[593] M. Widmer,et al. Job Shop Scheduling with Tooling Constraints: a Tabu Search Approach , 1991 .
[594] Jean-François Puget,et al. On the Satisfiability of Symmetrical Constrained Satisfaction Problems , 1993, ISMIS.
[595] Pierre Courrieu. A convergent generator of neural networks , 1993, Neural Networks.
[596] D. Werra,et al. EPCOT : an Efficient Procedure for Coloring Optimally with Tabu search , 1993 .
[597] M. Forti,et al. Necessary and sufficient condition for absolute stability of neural networks , 1994 .
[598] S. Norre,et al. Ordonnancement de tâches sur un système multiprocesseur - modèles déterministes et modèles stochastiques , 1994 .
[599] Lixin Tao,et al. Multi-way graph partition by stochastic probe , 1993, Comput. Oper. Res..
[600] T. Kohonen. Self-organized formation of topographically correct feature maps , 1982 .
[601] M. Wright. A Fair Allocation of County Cricket Opponents , 1992 .
[602] Roberto Battiti,et al. TOTEM: A HIGHLY PARALLEL CHIP FOR TRIGGERING APPLICATIONS WITH INDUCTIVE LEARNING BASED ON THE REACTIVE TABU SEARCH , 1995 .
[603] T. Richards,et al. Techniques for routeing and scheduling services on a transmission network , 1995 .
[604] J. Arora,et al. Methods for optimization of nonlinear problems with discrete variables: A review , 1994 .
[605] B. Golden,et al. Using simulated annealing to solve routing and location problems , 1986 .
[606] Weng Tat Chan,et al. Road-maintenance planning using genetic algorithms. I: Formulation , 1994 .
[607] Helena Ramalhinho Dias Lourenço,et al. Job-shop scheduling: Computational study of local search and large-step optimization methods , 1995 .
[608] P. V. Laarhoven,et al. A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem , 1988 .
[609] Rob A. Rutenbar,et al. Placement by Simulated Annealing on a Multiprocessor , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[610] P. Brandimarte. Neighbourhood search-based optimization algorithms for production scheduling: a survey , 1992 .
[611] Stefan Voß,et al. The Two — Stage Hybrid — Flowshop Scheduling Problem with Sequence — Dependent Setup Times , 1993 .
[612] ANTHONY WREN,et al. A genetic algorithm for public transport driver scheduling , 1995, Comput. Oper. Res..
[613] Jonathan Cagan,et al. A Simulated Annealing-Based Approach to Three-Dimensional Component Packing , 1995 .
[614] Dharmendra K. Gupta,et al. An enhancement scheme for constraint satisfaction problems (CSPs) , 1993 .
[615] Mitsuo Gen,et al. Film-copy deliverer problem using genetic algorithms , 1995 .
[616] Xingzhao Liu,et al. Genetic Channel Router , 1994 .
[617] William J. Cook,et al. Combinatorial optimization , 1997 .
[618] Jacek Blazewicz,et al. Using a tabu search approach for solving the two-dimensional irregular cutting problem , 1993, Ann. Oper. Res..
[619] Carl T. Uhrik,et al. Exploiting Domain Knowledge, Neural Networks and Genetic Algorithms to Harvest Traffic Simulation Results , 1993, KNOWHSEM.
[620] Hajime Kita,et al. Solving a placement problem by means of an analog neural network , 1992, IEEE Trans. Ind. Electron..
[621] Catherine C. McGeoch. Experimental analysis of algorithms , 1986 .
[622] Jun Wang,et al. A sensor-based accelerated approach for multi-attribute machinability and tool life evaluation , 1990 .
[623] T. Blum,et al. A variational study of directed polymers in disordered media with short-range correlations , 1994 .
[624] Shu-Park Chan,et al. A genetic approach for network partitioning , 1992, Int. J. Comput. Math..
[625] Martina Gorges-Schleuter,et al. Explicit Parallelism of Genetic Algorithms through Population Structures , 1990, PPSN.
[626] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[627] Sally McClean,et al. Heuristic Methods for the Data Placement Problem , 1991 .
[628] C. Ribeiro,et al. Clustering and clique partitioning: Simulated annealing and tabu search approaches , 1992 .
[629] Yuejun Jiang,et al. Ng-backmarking: an algorithm for constraint satisfaction , 1995 .
[630] Rex K. Kincaid,et al. Solving the damper placement problem via local search heuristics , 1995 .
[631] C. Rego,et al. Using Tabu search for solving a dynamic multi-terminal truck dispatching problem , 1995 .
[632] Jadranka Skorin-Kapov,et al. Scheduling a flow-line manufacturing cell: a tabu search approach , 1993 .
[633] J. Pekny,et al. Exact solution of the no-wait flowshop scheduling problem with a comparison to heuristic methods , 1991 .
[634] Phil Husbands,et al. Genetic Algorithms, Production Plan Optimisation, and Scheduling , 1990, PPSN.
[635] Jennifer Ryan,et al. The Depth and Width of Local Minima in Discrete Solution Spaces , 1995, Discret. Appl. Math..
[636] Bernard T. Han,et al. Multiple-type, two-dimensional bin packing problems: Applications and algorithms , 1994, Ann. Oper. Res..
[637] Pierre Lefrançois,et al. A genetic search algorithm to optimize job sequencing under a technological constraint in a rolling-mill facility , 1995 .
[638] Mihalis Yannakakis,et al. The Analysis of Local Search Problems and Their Heuristics , 1990, Symposium on Theoretical Aspects of Computer Science.
[639] Mahesan Niranjan,et al. A theoretical investigation into the performance of the Hopfield model , 1990, IEEE Trans. Neural Networks.
[640] Roberto Battiti,et al. The Reactive Tabu Search , 1994, INFORMS J. Comput..
[641] Rasaratnam Logendran,et al. Tabu search-based heuristics for cellular manufacturing systems in the presence of alternative process plans , 1994 .
[642] David L. Woodruff,et al. Chunking Applied to Reactive Tabu Search , 1996 .
[643] S. Chi,et al. Generalized part family formation using neural network techniques , 1992 .
[644] Gerrit Kateman,et al. Gates Towards Evolutionary Large-scale Optimization: A Software-oriented Approach to Genetic Algorithms - II. Toolbox Description , 1994, Comput. Chem..
[645] Byron J. T. Morgan,et al. Automatic starting point selection for function optimization , 1994 .
[646] Jadranka Skorin-Kapov,et al. Massively parallel tabu search for the quadratic assignment problem , 1993, Ann. Oper. Res..
[647] Panos M. Pardalos,et al. A Parallel Grasp Implementation for the Quadratic Assignment Problem , 1995 .
[648] Chun-Chang Liu,et al. Multi-objective VAR Planning Using An Interactive Satisfying Method , 1995 .
[649] Takashi Kido,et al. Analysis And Comparisons of Genetic Algorithm, Simulated Annealing, Tabu Search, and Evolutionary Combination Algorithm , 1994, Informatica.
[650] Jun Wang,et al. Recurrent neural networks for linear programming: Analysis and design principles , 1992, Comput. Oper. Res..
[651] Mutsunori Yagiura,et al. Genetic and Local Search Algorithms as Robust and Simple Optimization Tools , 1996 .
[652] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .
[653] S. Brooks,et al. Optimization Using Simulated Annealing , 1995 .
[654] Lalit M. Patnaik,et al. Genetic algorithms: a survey , 1994, Computer.
[655] Uday Kumar Chakraborty,et al. Using Reliability Analysis to Estimate the Number of Generations to Convergence in Genetic Algorithms , 1993, Inf. Process. Lett..
[656] R. Racine,et al. A computer application in apparel manufacturing management , 1992 .
[657] Hisao Ishibuchi,et al. Selection of fuzzy if‐then rules by a genetic method , 1994 .
[658] Bruce E. Stuckman,et al. A comparison of Bayesian/sampling global optimization techniques , 1992, IEEE Trans. Syst. Man Cybern..
[659] Eugene L. Lawler,et al. Traveling Salesman Problem , 2016 .
[660] Emile H. L. Aarts,et al. Parallel local search , 1995, J. Heuristics.
[661] José Luis González Velarde,et al. A search heuristic for just-in-time scheduling in parallel machines , 1991, J. Intell. Manuf..
[662] Jonathan Cagan,et al. Optimally Directed Shape Generation by Shape Annealing , 1993 .
[663] Kazuyuki Aihara,et al. Chaotic simulated annealing by a neural network model with transient chaos , 1995, Neural Networks.
[664] Fred Glover,et al. Tabu Search: A Tutorial , 1990 .
[665] Emanuel Falkenauer,et al. A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems , 1994, Evolutionary Computation.
[666] Michael J. Brusco,et al. Improving Personnel Scheduling at Airline Stations , 1995, Oper. Res..
[667] Lalit M. Patnaik,et al. A genetic algorithm-based circuit partitioner for MCMs , 1995, Microprocess. Microprogramming.
[668] Lefteris M. Kirousis,et al. Fast Parallel Constraint Satisfaction , 1993, Artif. Intell..
[669] D. Fogel. Applying evolutionary programming to selected traveling salesman problems , 1993 .
[670] Bing J. Sheu,et al. Paralleled hardware annealing in multilevel Hopfield neural networks for optimal solutions , 1995 .
[671] Michel Gendreau,et al. The m-Traveling Salesman Problem with Minmax Objective , 1995, Transp. Sci..
[672] M. Huber. Structural optimization of vapor pressure correlations using simulated annealing and threshold accepting: Application to R134a☆ , 1994 .
[673] Kenji Itoh,et al. SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS , 1995 .
[674] John M. Mulvey,et al. Solving Dynamic Stochastic Control Problems in Finance Using Tabu Search with Variable Scaling , 1996 .
[675] W. T. Illingworth,et al. Practical guide to neural nets , 1991 .
[676] Paul Farris,et al. A sensitivity analysis of retailer shelf management models , 1995 .
[677] John N. Tsitsiklis,et al. Markov Chains with Rare Transitions and Simulated Annealing , 1989, Math. Oper. Res..
[678] G. Parisi,et al. Simulated tempering: a new Monte Carlo scheme , 1992, hep-lat/9205018.
[679] S. Arunkumar,et al. Genetic algorithm based heuristics for the mapping problem , 1995, Comput. Oper. Res..
[680] Hasan Pirkul,et al. Foreword : Heuristic, Genetic and Tabu Search , 1994, Comput. Oper. Res..
[681] B. R. Fox,et al. Genetic Operators for Sequencing Problems , 1990, FOGA.
[682] Samy Bengio,et al. The Vehicle Routing Problem with Time Windows Part II: Genetic Search , 1996, INFORMS J. Comput..
[683] Stefan Voß. Network Design Formulations in Schedule Synchronization , 1992 .
[684] K. Y. Tam,et al. Genetic algorithms, function optimization, and facility layout design , 1992 .
[685] Kemal Efe,et al. Statistical analysis of parallel randomized algorithms for VLSI placement and implementation on workstation networks , 1995, Microprocess. Microsystems.
[686] Heinz Mühlenbein,et al. The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA) , 1993, Evolutionary Computation.
[687] Zbigniew Michalewicz,et al. A Hierarchy of Evolution Programs: An Experimental Study , 1993, Evolutionary Computation.
[688] Peter Ross,et al. Comparing Genetic Algorithms, Simulated Annealing, and Stochastic Hillclimbing on Timetabling Problems , 1995, Evolutionary Computing, AISB Workshop.
[689] Salvatore Cavalieri,et al. Optimal path determination in a graph by hopfield neural network , 1994, Neural Networks.
[690] Xin Yao,et al. An empirical study of genetic operators in genetic algorithms , 1993, Microprocess. Microprogramming.
[691] Jean-Luc Lutton,et al. The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach , 1986 .
[692] A. Dhingra,et al. Single and multiobjective structural optimization in discrete‐continuous variables using simulated annealing , 1995 .
[693] Panos M. Pardalos,et al. A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.
[694] M. Dorigo,et al. Algodesk : an experimental comparison of eight evolutionary heuristics applied to the Quadratic Assignment Problem , 1995 .
[695] C. P. Ravikumar,et al. Parallel techniques for solving large scale travelling salesperson problems , 1992, Microprocess. Microsystems.
[696] Gilbert Laporte,et al. Metaheuristics in combinatorial optimization , 1996 .
[697] E. El-Darzi,et al. A Metaheuristic for the Timetabling Problem. , 1996 .
[698] N. Viswanadham,et al. Location of quality-control stations in manufacturing systems: A simulated annealing approach , 1994 .
[699] A. Trouvé. Asymptotical behaviour of several interacting annealing processes , 1995 .
[700] Kotaro Hirasawa,et al. Solving inequality constrained combinatorial optimization problems by the hopfield neural networks , 1992, Neural Networks.
[701] Bing J. Sheu,et al. Paralleled hardware annealing for optimal solutions on electronic neural networks , 1993, IEEE Trans. Neural Networks.
[702] Buyang Cao,et al. Solving transportation problems with nonlinear side constraints with tabu search , 1995, Comput. Oper. Res..
[703] A. E. Eiben,et al. Global Convergence of Genetic Algorithms: A Markov Chain Analysis , 1990, PPSN.
[704] David Cyganski,et al. Multivariate Classification through Adaptive Delaunay-Based C0 Spline Approximation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[705] L. Darrell Whitley,et al. Optimization Using Distributed Genetic Algorithms , 1990, PPSN.
[706] M. Laguna,et al. SOLVING THE MULTIPLE-MACHINE WEIGHTED FLOW TIME PROBLEM USING TABU SEARCH , 1993 .
[707] Mitsuo Gen,et al. A method for maintenance scheduling using GA combined with SA , 1994 .
[708] C. P. Ravikumar. Parallel search-and-learn technique for solving large scale travelling-salesperson problems , 1994, Knowl. Based Syst..
[709] Viviane Gascon,et al. Using the tabu search method for the distribution of supplies in a hospital , 1994, Ann. Oper. Res..
[710] Sanguthevar Rajasekaran,et al. Nested Annealing: A Provable Improvement to Simulated Annealing , 1992, Theor. Comput. Sci..
[711] Kalyanmoy Deb,et al. Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..
[712] Yoh-Han Pao,et al. Combinatorial optimization with use of guided evolutionary simulated annealing , 1995, IEEE Trans. Neural Networks.
[713] Richard Szeliski,et al. An Analysis of the Elastic Net Approach to the Traveling Salesman Problem , 1989, Neural Computation.
[714] Brigitte Jaumard,et al. A selected artificial intelligence bibliography for operations researchers , 1988 .
[715] Chun Che Fung,et al. Simulated annealing based economic dispatch algorithm , 1993 .
[716] Vipin Kumar,et al. Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..
[717] Wolfgang Domschke,et al. Schedule synchronization for public transit networks , 1989 .
[718] Nirwan Ansari,et al. A Genetic Algorithm for Multiprocessor Scheduling , 1994, IEEE Trans. Parallel Distributed Syst..
[719] William M. Spears,et al. A Study of Crossover Operators in Genetic Programming , 1991, ISMIS.
[720] Michel Gendreau,et al. Synchronous tabu search parallelization strategies for multicommodity location-allocation with balancing requirements , 1995 .
[721] J. A. Bland. A derivative-free exploratory tool for function minimisation based on tabu search , 1994 .
[722] I-Cheng Yeh. Construction-Site Layout Using Annealed Neural Network , 1995 .
[723] W. Mergenthaler,et al. Optimizing automotive manufacturing sequences using simulated annealing and genetic algorithms , 1995 .
[724] Bing J. Sheu,et al. Hardware annealing in analog VLSI neurocomputing , 1990 .
[725] Oliver Vornberger,et al. Parallel Genetic Packing of Rectangles , 1990, PPSN.
[726] Wen-Chyuan Chiang,et al. A simulated annealing procedure for single row layout problems in flexible manufacturing systems , 1992 .
[727] John J. Grefenstette,et al. Test and evaluation by genetic algorithms , 1993, IEEE Expert.
[728] Shumeet Baluja,et al. Structure and Performance of Fine-Grain Parallelism in Genetic Search , 1993, ICGA.
[729] Lashon B. Booker,et al. Proceedings of the fourth international conference on Genetic algorithms , 1991 .
[730] Bernard T. Han,et al. Efficient heuristics for robot acquisition planning for a CIM system , 1995 .
[731] J. Hopfield,et al. Computing with neural circuits: a model. , 1986, Science.
[732] Kurt Jörnsten,et al. Tabu search within a pivot and complement framework , 1994 .
[733] Salvatore Orlando,et al. Strategies for a Massively Parallel Implementation of Simulated Annealing , 1989, PARLE.
[734] Gary S. Wasserman,et al. All subsets regression using a genetic search algorithm , 1994 .
[735] Sally McClean,et al. Application of simulated annealing to clustering tuples in databases , 1990 .
[736] Claude Le Pape,et al. Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems , 1994 .
[737] I. Nishikawa,et al. Line balancing using a genetic evolution model , 1995 .
[738] Karl-Heinz Hoffmann,et al. Optimizing Simulated Annealing , 1990, PPSN.
[739] Z. Michalewicz,et al. Genetic algorithms for numerical optimization , 1991 .
[740] R. Kuik,et al. Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic , 1990 .
[741] S. Arunkumar,et al. Genetic search algorithms and their randomized operators , 1993 .
[742] Edward P. K. Tsang,et al. Foundations of constraint satisfaction , 1993, Computation in cognitive science.
[743] Zhen-Ping Lo,et al. Optimization of job scheduling on parallel machines by simulated annealing algorithms , 1992 .
[744] Giancarlo Mauri,et al. Flowshop and TSP , 1989 .
[745] Jonathan Cagan. Shape annealing solution to the constrained geometric knapsack problem , 1994, Comput. Aided Des..
[746] David L. Woodruff. Ghost Image Processing for Minimum Covariance Determinants , 1995, INFORMS J. Comput..
[747] John E. Savage,et al. Parallelism in Graph-Partitioning , 1991, J. Parallel Distributed Comput..
[748] R. C. Mann,et al. An extension of the Hopfield-Tank model for solution of the multiple traveling salesmen problem , 1988, IEEE 1988 International Conference on Neural Networks.
[749] Ramesh Sharda,et al. Neural Networks for the MS/OR Analyst: An Application Bibliography , 1994 .
[750] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[751] M. R. Zargham,et al. A simulated annealing multi-layer router , 1992, Integr..
[752] Laurent Hérault,et al. Neural Networks and Graph K-Partitioning , 1989, Complex Syst..
[753] A. E. A. Almaini,et al. State assignment of finite state machines using a genetic algorithm , 1995 .
[754] Ru-Qin Yu,et al. Cluster Analysis by Simulated Annealing , 1994, Comput. Chem..
[755] S. Amari. [Neural Networks: A Review from Statistical Perspective]: Comment , 1994 .
[756] Heinz Mühlenbein,et al. How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.
[757] Cheng-Yan Kao,et al. Applying the genetic approach to simulated annealing in solving some NP-hard problems , 1993, IEEE Trans. Syst. Man Cybern..
[758] Rema Padman. Choosing Solvers in Decision Support Systems: A Neural Network Application in Resource-Constrained Project Scheduling , 1993 .
[759] Yih-Long Chang,et al. A simulated annealing approach to scheduling a manufacturing cell , 1990 .
[760] Saïd Hanafi,et al. Comparison of Heuristics for the 0–1 Multidimensional Knapsack Problem , 1996 .
[761] Fred Glover,et al. Critical Event Tabu Search for Multidimensional Knapsack Problems , 1996 .
[762] Chao-Hsien Chu,et al. Neural network system for forecasting method selection , 1994, Decis. Support Syst..
[763] Colin R. Reeves,et al. A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..
[764] Arne Løkketangen. Tabu Search - Using the Search Experience to Guide the Search Process. An Introduction with Examples , 1995, AI Commun..
[765] Kihong Park,et al. On the effectiveness of genetic search in combinatorial optimization , 1995, SAC '95.
[766] Victor J. Rayward-Smith,et al. The Radio Link Frequency Assignment Problem: A Case Study Using Genetic Algorithms , 1995, Evolutionary Computing, AISB Workshop.
[767] Christos H. Papadimitriou,et al. The Complexity of the Lin-Kernighan Heuristic for the Traveling Salesman Problem , 1992, SIAM J. Comput..
[768] G. Vanderplaats,et al. Survey of Discrete Variable Optimization for Structural Design , 1995 .
[769] Richard J. Bauer,et al. Genetic Algorithms and Investment Strategies , 1994 .
[770] Reza H. Ahmadi,et al. An Operation Partitioning Problem for Automated Assembly System Design , 1991, Oper. Res..
[771] Andrew Sohn,et al. Parallel N-ary Speculative Computation of Simulated Annealing , 1995, IEEE Trans. Parallel Distributed Syst..
[772] Dana S. Richards,et al. A Multi-Population Genetic Algorithm for Solving the K-Partition Problem on Hyper-Cubes , 1991, ICGA.
[773] Giorgio Ausiello,et al. Local Search, Reducibility and Approximability of NP-Optimization Problems , 1995, Inf. Process. Lett..
[774] Ii Lawrence John Schmitt. An empirical computational study of genetic algorithms to solve order based problems: an emphasis on TSP and VRPTC , 1994 .
[775] Emile H. L. Aarts,et al. Parallel implementations of the statistical cooling algorithm , 1986, Integr..
[776] Jan Karel Lenstra,et al. A local search template , 1998, Comput. Oper. Res..
[777] Kenji Itoh,et al. Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge , 1995 .
[778] Peter J. Fleming,et al. Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.
[779] D. de Werra,et al. A tutorial on heuristic methods , 1980 .
[780] John E. Biegel,et al. Genetic algorithms and job shop scheduling , 1990 .
[781] F. Darema,et al. Parallel Algorithms for Chip Placement by Simulated Annealing , 1987, IBM J. Res. Dev..
[782] Gunar E. Liepins,et al. Some Guidelines for Genetic Algorithms with Penalty Functions , 1989, ICGA.
[783] Gilbert Laporte,et al. A tabu search heuristic for the multi-depot vehicle routing problem , 1996, Comput. Oper. Res..
[784] Peter Ross,et al. A Promising Genetic Algorithm Approach to Job-Shop SchedulingRe-Schedulingand Open-Shop Scheduling Problems , 1993, ICGA.
[785] Herbert Kopfer,et al. Entwicklung eines hybriden Genetischen Algorithmus zur Tourenplanung , 1994 .
[786] Melody Y. Kiang,et al. Managerial Applications of Neural Networks: The Case of Bank Failure Predictions , 1992 .
[787] Ola Sallnäs,et al. Harvest scheduling under adjacency constraints — a case study from the Swedish sub‐alpine region , 1993 .
[788] Yoshiyasu Takefuji,et al. Neural networks in design and manufacturing , 1993 .
[789] Mauricio G. C. Resende,et al. A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set , 1994, Oper. Res..
[790] Andrew B. Kahng,et al. Recent directions in netlist partitioning: a survey , 1995, Integr..
[791] U. Diwekar,et al. Stochastic annealing for synthesis under uncertainty , 1995 .
[792] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[793] Stephen F. Smith,et al. ISIS—a knowledge‐based system for factory scheduling , 1984 .
[794] Jude W. Shavlik,et al. Knowledge-Based Artificial Neural Networks , 1994, Artif. Intell..
[795] J. Eheart,et al. Using Genetic Algorithms to Solve a Multiobjective Groundwater Monitoring Problem , 1995 .
[796] A. S. Al-Mahmeed,et al. Tabu Search, Combination and Integration , 1996 .
[797] Kimiaki Yamamoto,et al. Combinatorial optimization by using a neural network operating in block-sequential mode , 1994, Systems and Computers in Japan.
[798] P. Healy,et al. A new extension of local search applied to the Dial-A-Ride Problem , 1995 .
[799] Miroslaw Malek,et al. Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem , 1990 .
[800] Miroslaw Malek,et al. A TSP engine for performing tabu search , 1991, Proceedings of the International Conference on Application Specific Array Processors.
[801] M Ishikawa,et al. Multiple sequence alignment by parallel simulated annealing , 1993, Comput. Appl. Biosci..
[802] Jun Gu. Design Efficient Local Search Algorithms , 1992, IEA/AIE.
[803] Bennett L. Fox,et al. Faster Simulated Annealing , 1995, SIAM J. Optim..
[804] Jun Wang,et al. Multiple-objective optimisation of machining operations based on neural networks , 1993 .
[805] P. Hall. 7 – Miscellaneous Applications , 1980 .
[806] Robert E. Smith,et al. Optimal clustering of power networks using genetic algorithms , 1994 .
[807] James R. Evans,et al. Heuristic methods and applications: A categorized survey , 1989 .
[808] Jadranka Skorin-Kapov,et al. On minimum congestion routing in rearrangeable multihop lightwave networks , 1995, J. Heuristics.
[809] Erwin Pesch,et al. Genetic Local Search in Combinatorial Optimization , 1994, Discret. Appl. Math..
[810] Koichi Nara,et al. Maintenance scheduling by using simulated annealing method (for power plants) , 1991 .
[811] Fred Glover,et al. Tabu search methods for a single machine scheduling problem , 1991, J. Intell. Manuf..
[812] Michael J. Shaw,et al. A Double-Layered Learning Approach to Acquiring Rules for Classification: Integrating Genetic Algorithms with Similarity-Based Learning , 1994, INFORMS J. Comput..
[813] Heinz Mühlenbein,et al. Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization , 1993, Evolutionary Computation.
[814] David Mark Levine,et al. A parallel genetic algorithm for the set partitioning problem , 1995 .
[815] Charles J. Malmborg. Heuristic, storage space minimization methods for facility layouts served by looped AGV systems , 1994 .
[816] Heskes,et al. Cooling schedules for learning in neural networks. , 1993, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[817] Nelson Stephens,et al. Tabu Thresholding for the Frequency Assignment Problem , 1996 .
[818] Lester Ingber,et al. Simulated annealing: Practice versus theory , 1993 .
[819] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[820] Harvey J. Greenberg,et al. New approaches for heuristic search: A bilateral linkage with artificial intelligence , 1989 .
[821] John H. Kalivas,et al. Further investigation on a comparative study of simulated annealing and genetic algorithm for wavelength selection , 1995 .
[822] Gunar E. Liepins,et al. Genetic Algorithms Applications to Set Covering and Traveling Salesman Problems , 1990 .
[823] O. Catoni. Rough Large Deviation Estimates for Simulated Annealing: Application to Exponential Schedules , 1992 .
[824] Volker Nissen,et al. Evolutionary Algorithms in Management Applications , 1995 .
[825] Marc M. Van Hulle,et al. Representation and processing in a stochastic neural network: An integrated approach , 1991, Neural Networks.
[826] Hua Li,et al. Solving Simultaneous Linear Equations Using Recurrent Neural Networks , 1994, Inf. Sci..
[827] Kum Khiong Yang,et al. A comparison of stochastic scheduling rules for maximizing project net present value , 1995 .
[828] James R. A. Allwright,et al. A distributed implementation of simulated annealing for the travelling salesman problem , 1989, Parallel Comput..
[829] J. Lutton,et al. Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms , 1995 .
[830] K. Y. Tam,et al. A simulated annealing algorithm for allocating space to manufacturing cells , 1992 .
[831] Emile H. L. Aarts,et al. Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling , 1994, European Conference on Artificial Intelligence.
[832] Edward Tsang. Scheduling techniques: a comparative study , 1995 .
[833] Per S. Laursen. An experimental comparison of three heuristics for the WVCP , 1994 .
[834] A. Federgruen,et al. Simulated annealing methods with general acceptance probabilities , 1987, Journal of Applied Probability.
[835] F. H. Lee,et al. Parallel annealing on distributed memory systems , 1995 .
[836] Loren Paul Rees,et al. Assembly Line Balancing Using Genetic Algorithms with Heuristic‐Generated Initial Populations and Multiple Evaluation Criteria* , 1994 .
[837] G. S. Stiles. The effect of numerical precision upon simulated annealing , 1994 .
[838] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[839] Varghese S. Jacob,et al. A study of the classification capabilities of neural networks using unsupervised learning: A comparison withK-means clustering , 1994 .
[840] Shawki Areibi,et al. Circuit partitioning using a Tabu search approach , 1993, 1993 IEEE International Symposium on Circuits and Systems.
[841] Chae Y. Lee,et al. GENETIC ALGORITHMS FOR SINGLE MACHINE JOB SCHEDULING WITH COMMON DUE DATE AND SYMMETRIC PENALTIES , 1994 .
[842] Hassan Ghaziri,et al. Supervision in the Self-Organizing Feature Map: Application to the Vehicle Routing Problem , 1996 .
[843] C. B. Lucasius,et al. Understanding and using genetic algorithms Part 2. Representation, configuration and hybridization , 1994 .
[844] David W. Wright,et al. Using Artificial Neural Networks to Pick Stocks , 1993 .
[845] David B. Fogel,et al. An introduction to simulated evolutionary optimization , 1994, IEEE Trans. Neural Networks.
[846] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.
[847] V. Cerný. Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm , 1985 .
[848] Yoshiaki Ichikawa,et al. Neural network application for direct feedback controllers , 1992, IEEE Trans. Neural Networks.
[849] John H. Holland,et al. When will a Genetic Algorithm Outperform Hill Climbing , 1993, NIPS.
[850] Jiri Pospichal,et al. Fast Evaluation of Chemical Distance by Tabu Search Algorithm , 1994, Journal of chemical information and computer sciences.
[851] Jan Bos,et al. Zoning in Forest Management: a Quadratic Assignment Problem Solved by Simulated Annealing , 1993 .
[852] Emile H. L. Aarts,et al. Randomized constraint satisfaction for job shop scheduling and control , 1993 .
[853] David J. Evans,et al. The Annealing Evolution Algorithm as Function Optimizer , 1995, Parallel Comput..
[854] Youssef Saab,et al. A Stochastic Algorithm for Circuit Bi-Partitioning , 1989, Great Lakes Computer Science Conference.
[855] M.D. Durand. Parallel simulated annealing: accuracy vs. speed in placement , 1989, IEEE Design & Test of Computers.
[856] Mohammad M. Amini,et al. A rigorous computational comparison of alternative solution methods for the generalized assignment problem , 1994 .
[857] Gp Babu,et al. Simulated annealing for selecting optimal initial seeds in the K-means algorithm , 1994 .
[858] Dominique de Werra,et al. A convoy scheduling problem , 1991, Discret. Appl. Math..
[859] B. Hajek,et al. Simulated annealing—to cool or not , 1989 .
[860] Taeyong Yang,et al. An effective heuristic method for generalized job shop scheduling with due dates , 1994 .
[861] Norman Sadeh,et al. Learning to Recognize (Un)Promising Simulated Annealing Runs: Efficient Search Procedures for Job Shop Scheduling and Vehicle Routing , 1997 .
[862] Ibrahim H. Osman,et al. Local search algorithms for the maximal planar layout problem , 1995 .
[863] L. Darrell Whitley,et al. Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator , 1989, International Conference on Genetic Algorithms.
[864] Andy J. Keane,et al. A brief comparison of some evolutionary optimization methods , 1996 .
[865] Benjamin W. Wah,et al. A SEQUENTIAL SAMPLING PROCEDURE FOR GENETIC ALGORITHMS , 1994 .
[866] Vladimiro Miranda,et al. Genetic algorithms in optimal multistage distribution network planning , 1994 .
[867] Mike Wright,et al. A Preliminary Investigation into the Performance of Heuristic Search Methods Applied to Compound , 1996 .
[868] Francesco Palmieri,et al. Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space. Part II: Analysis of the diversification role of crossover , 1994, IEEE Trans. Neural Networks.
[869] Stanley F. Bullington,et al. An effective heuristic for flow shop problems with total flow time as criterion , 1993 .
[870] F. D. Croce,et al. Advanced search techniques for the job shop problem : a comparison , 1995 .
[871] L. F. Gulyanitskii,et al. Convergence of a simulation method for solution of combinatorial optimization problems , 1993 .
[872] Takakazu Kurokawa,et al. Use of neural networks for the optimum frequency assignment problem , 1994 .
[873] Samir W. Mahfoud. Finite Markov Chain Models of an Alternative Selection Strategy for the Genetic Algorithm , 1993, Complex Syst..
[874] Erik H. Vanmarcke,et al. Risk-based bridge management: optimization and inspection scheduling , 1994 .
[875] Choi,et al. Optimization by multicanonical annealing and the traveling salesman problem. , 1994, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[876] John Mingers,et al. Neural Networks, Decision Tree Induction and Discriminant Analysis: an Empirical Comparison , 1994 .
[877] Richard S. Segall,et al. Some mathematical and computer modelling of neural networks , 1995 .
[878] Matthew L. Ginsberg,et al. Dynamic Backtracking , 1993, J. Artif. Intell. Res..
[879] Gareth Jones,et al. AN INTRODUCTION TO GENETIC ALGORITHMS AND TO THEIR USE IN INFORMATION RETRIEVAL , 1994 .
[880] Rainer Schrader,et al. On the Convergence of Stationary Distributions in Simulated Annealing Algorithms , 1988, Inf. Process. Lett..
[881] Yehoshua Y. Zeevi,et al. Neural networks: theory and applications , 1992 .
[882] David E. van den Bout,et al. Graph partitioning using annealed neural networks , 1990, International 1989 Joint Conference on Neural Networks.
[883] Takeshi Yamada,et al. Conventional Genetic Algorithm for Job Shop Problems , 1991, ICGA.
[884] Shokri Z. Selim,et al. A simulated annealing algorithm for the clustering problem , 1991, Pattern Recognit..
[885] Stephen G. Nash,et al. Guidelines for reporting results of computational experiments. Report of the ad hoc committee , 1991, Math. Program..
[886] Zhen-Ping Lo,et al. Multiple job scheduling with artificial neural networks , 1993 .
[887] Lawrence. Davis,et al. Handbook Of Genetic Algorithms , 1990 .
[888] Vassilis Zissimopoulos. On the Performance Guarantee of Neural Networks for NP-Hard Optimization Problems , 1995, Inf. Process. Lett..
[889] S. R. Thangiah,et al. MICAH: a genetic algorithm system for multi-commodity transshipment problems , 1992, Proceedings Eighth Conference on Artificial Intelligence for Applications.
[890] F. Eeckman,et al. Evolution and Biocomputation: Computational Models of Evolution , 1995 .
[891] William L. Goffe,et al. Simulated annealing: An initial application in econometrics , 1992 .
[892] Barry J. Wythoff,et al. Backpropagation neural networks , 1993 .
[893] Fred Glover,et al. Integrating target analysis and tabu search for improved scheduling systems , 1993 .
[894] G. S. Singh,et al. On fast load partitioning by simulated annealing and heuristic algorithms for general class of problems , 1993 .
[895] Gunar E. Liepins,et al. Genetic algorithms: Foundations and applications , 1990 .
[896] Jurij Silc,et al. Algorithm Mapping with Parallel Simulated Annealing , 1995, Comput. Artif. Intell..
[897] K. Dowsland. HILL-CLIMBING, SIMULATED ANNEALING AND THE STEINER PROBLEM IN GRAPHS , 1991 .
[898] M. Piccioni,et al. Optimal selection of statistical units: an approach via simulated annealing , 1992 .
[899] Abraham P. Punnen,et al. Categorized Assignment Scheduling: a Tabu Search Approach , 1993 .
[900] Myunghwan Kim,et al. Stepwise-overlapped parallel annealing and its application to floorplan designs , 1991, Comput. Aided Des..
[901] David Connolly,et al. General Purpose Simulated Annealing , 1992 .
[902] M. Resende,et al. A probabilistic heuristic for a computationally difficult set covering problem , 1989 .
[903] Alain Guinet. Scheduling independent jobs on uniform parallel machines to minimize tardiness criteria , 1995, J. Intell. Manuf..
[904] Nigel Dodd,et al. Slow annealing versus multiple fast annealing runs - an empirical investigation , 1990, Parallel Comput..
[905] Simon Lin,et al. Nearest-neighbour heuristics in accelerated algorithms of optimisation problems , 1994 .
[906] Jean-Yves Potvin,et al. Integrating Operations Research and Neural Networks for Vehicle Routing , 1995 .
[907] Alan L. Yuille,et al. Generalized Deformable Models, Statistical Physics, and Matching Problems , 1990, Neural Computation.
[908] Eric B. Bartlett,et al. A stochastic training algorithm for artificial neural networks , 1994, Neurocomputing.
[909] Chung-Kuan Cheng,et al. An efficient multilevel placement technique using hierarchical partitioning , 1992 .
[910] Peter Salamon,et al. Ensemble approach to simulated annealing , 1991 .
[911] Jan Korst,et al. Deterministic and randomized local search , 1993 .
[912] Stefan Voß,et al. Strategies with memories: local search in an application oriented environment , 1995 .
[913] Attahiru Sule Alfa,et al. AN EXPERIMENTAL ANALYSIS OF THE SIMULATED ANNEALING ALGORITHM FOR A SINGLE MACHINE SCHEDULING PROBLEM , 1995 .
[914] Stefano Rizzi,et al. Topological clustering of maps using a genetic algorithm , 1995, Pattern Recognit. Lett..
[915] B. S. Kiselev,et al. A modification of the annealing imitation method for solving combinatorial optimization problems , 1993 .
[916] J. A. George,et al. Packing different-sized circles into a rectangular container , 1995 .
[917] Andrew E. W. Jones,et al. An adaptive simulated annealing algorithm for global optimization over continuous variables , 1995, J. Glob. Optim..
[918] A. Hertz. Tabu search for large scale timetabling problems , 1991 .
[919] Nallan C. Suresh,et al. An improved neural network leader algorithm for part-machine grouping in group technology , 1993 .
[920] Werner Kinnebrock,et al. Accelerating the standard backpropagation method using a genetic approach , 1994, Neurocomputing.
[921] Jorng-Tzong Horng,et al. Extending SQL with graph matching, set covering and partitioning , 1994 .
[922] L. Darrell Whitley,et al. The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.
[923] Stefen Hui,et al. Neural networks for constrained optimization problems , 1993, Int. J. Circuit Theory Appl..
[924] Teuvo Kohonen,et al. Self-organization and associative memory: 3rd edition , 1989 .
[925] Patrick van Bommel,et al. Genetic algorithms for optimal logical database design , 1994, Inf. Softw. Technol..
[926] David B. Fogel,et al. CONTINUOUS EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS , 1995 .
[927] C. Siva Ram Murthy,et al. An efficient heuristic algorithm for mapping parallel programs onto multicomputers , 1993, Microprocess. Microprogramming.
[928] Ronald L. Rardin,et al. Tabu search for a class of scheduling problems , 1993, Ann. Oper. Res..
[929] KumarVipin. Algorithms for constraint-satisfaction problems , 1992 .
[930] Éric D. Taillard,et al. Solving real-life vehicle routing problems efficiently using tabu search , 1993, Ann. Oper. Res..
[931] Jeffrey L. Elman,et al. Learning and Evolution in Neural Networks , 1994, Adapt. Behav..
[932] Darko Skorin-Kapov,et al. On minimum cost isolated failure immune networks , 1994, Telecommun. Syst..
[933] Kendall E. Nygard,et al. GIDEON: a genetic algorithm system for vehicle routing with time windows , 1991, [1991] Proceedings. The Seventh IEEE Conference on Artificial Intelligence Application.
[934] Éric D. Taillard,et al. Parallel Taboo Search Techniques for the Job Shop Scheduling Problem , 1994, INFORMS J. Comput..
[935] Cheng-Hong Yang,et al. Genetic Algorithms for the Traveling Salesman Problem with Time Windows , 1992, Computer Science and Operations Research.
[936] Kees M. van Hee,et al. Randomized constraint satisfaction for job shop scheduling , 1993, International Joint Conference on Artificial Intelligence.
[937] Cecilia R. Aragon,et al. Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning , 1991, Oper. Res..
[938] Jun Gu,et al. Efficient Local Search With Search Space Smoothing: A Case Study of the Traveling Salesman Problem (TSP) , 1994, IEEE Trans. Syst. Man Cybern. Syst..
[939] Patrick J. Sutton,et al. Genetic algorithms: A general search procedure , 1994 .
[940] Mark D. Johnston,et al. Scheduling with neural networks - the case of the hubble space telescope , 1992, Comput. Oper. Res..
[941] Laurene V. Fausett,et al. Fundamentals Of Neural Networks , 1994 .
[942] Sunderesh S. Heragu,et al. A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem , 1996, Ann. Oper. Res..
[943] Hironori Hirata,et al. Block placement by improved simulated annealing based on genetic algorithm , 1992 .
[944] David E. Goldberg,et al. Parallel Recombinative Simulated Annealing: A Genetic Algorithm , 1995, Parallel Comput..
[945] Michel Gendreau,et al. Parallel asynchronous tabu search for multicommodity location-allocation with balancing requirements , 1996, Ann. Oper. Res..
[946] José Nelson Amaral,et al. Designing genetic algorithms for the state assignment problem , 1995, IEEE Trans. Syst. Man Cybern..
[947] Yasuo Matsuyama,et al. Self-organization via competition, cooperation and categorization applied to extended vehicle routing problems , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.
[948] Yves Rochat,et al. A Tabu Search Approach for Delivering Pet Food and Flour in Switzerland , 1994 .
[949] J. G. Klincewicz,et al. Avoiding local optima in thep-hub location problem using tabu search and GRASP , 1993, Ann. Oper. Res..
[950] Jonathan F. Bard,et al. Note-Operations Sequencing in Discrete Parts Manufacturing , 1989 .
[951] Walter Kern,et al. On the Depth of Combinatorial Optimization Problems , 1993, Discret. Appl. Math..
[952] H. Ishibuchi,et al. Local search algorithms for flow shop scheduling with fuzzy due-dates☆ , 1994 .
[953] Dušan Teodorović,et al. A simulated annealing technique approach to the vehicle routing problem in the case of stochastic demand , 1992 .
[954] Jarosław Arabas,et al. A genetic approach to the Hopfield neural network in the optimization problems , 1994 .
[955] Peter M. Todd,et al. The Role of Mate Choice in Biocomputation: Sexual Selection as a Process of Search, Optimization and Diversification , 1995, Evolution and Biocomputation.
[956] Alan F. Murray. Applications of Neural Networks , 1994 .
[957] Jacques Teghem,et al. Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search , 1994, Ann. Oper. Res..
[958] Helena Ramalhinho Dias Lourenço,et al. Combining the Large-Step Optimization with Tabu-Search: Application to The Job-Shop Scheduling Problem , 1996 .
[959] D. Janaki Ram,et al. Distributed simulated annealing algorithms for job shop scheduling , 1995, IEEE Trans. Syst. Man Cybern..
[960] Robert J Willis,et al. Scheduling the Australian State Cricket Season Using Simulated Annealing , 1994 .
[961] Attahiru Sule Alfa,et al. A 3-OPT based simulated annealing algorithm for vehicle routing problems , 1991 .
[962] Marc Salomon,et al. LINEAR PROGRAMMING, SIMULATED ANNEALING AND TABU SEARCH HEURISTICS FOR LOTSIZING IN BOTTLENECK ASSEMBLY SYSTEMS , 1993 .
[963] Luis Rabelo,et al. A real-world scheduling problem using genetic algorithms , 1995 .
[964] R. A. Young,et al. A Hybrid Genetic Algorithm for a Logic Problem , 1990, European Conference on Artificial Intelligence.
[965] Mauricio G. C. Resende,et al. Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.
[966] Jun Wang,et al. Tool requirement planning in stochastic job shops: a simulated annealing approach , 1993 .
[967] T. T. Narendran,et al. Cell formation in manufacturing systems through simulated annealing: An experimental evaluation , 1992 .
[968] Alessandro De Gloria,et al. Clustered Boltzmann Machines: Massively Parallel Architectures for Constrained Optimization Problems , 1993, Parallel Comput..
[969] Marco Dorigo,et al. Genetic Algorithms and Highly Constrained Problems: The Time-Table Case , 1990, PPSN.
[970] Patrick Prosser,et al. Stochastic techniques for resource management , 1995 .
[971] Andrew B. Kahng,et al. Recent directions in netlist partitioning , 1995 .
[972] Martin W. Simmen. Parameter Sensitivity of the Elastic Net Approach to the Traveling Salesman Problem , 1991, Neural Computation.
[973] Jeffrey D. Tew,et al. Simulation optimization by genetic search , 1994 .
[974] Chandrasekharan Rajendran,et al. Scheduling in a cellular manufacturing system: a simulated annealing approach , 1993 .
[975] Abdelghani Souilah,et al. Simulated annealing for manufacturing systems layout design , 1995 .
[976] Kenji Itoh,et al. A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem , 1995 .
[977] Ramesh Sharda,et al. Knowledge-based systems and neural networks : techniques and applications , 1991 .
[978] M. Narasimha Murty,et al. A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm , 1993, Pattern Recognit. Lett..
[979] David L. Woodruff,et al. Hashing vectors for tabu search , 1993, Ann. Oper. Res..
[980] Venkat Venkatasubramanian,et al. A genetic algorithmic framework for process design and optimization , 1991 .
[981] Heinz Mühlenbein,et al. The parallel genetic algorithm as function optimizer , 1991, Parallel Comput..
[982] Hans F. Ravn,et al. Timetabling by Simulated Annealing , 1993 .
[983] Lalit M. Patnaik,et al. Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..
[984] Robert Piessens,et al. Load Balancing with Genetic Algorithms , 1992, Parallel Problem Solving from Nature.
[985] Jun Wang. Analysis and design of a recurrent neural network for linear programming , 1993 .
[986] Per S. Laursen. Simulated annealing for the QAP. Optimal tradeoff between simulation time and solution quality , 1993 .
[987] Pierre Chardaire,et al. Using Simulated annealing to solve concentrator location problems in telecommunication networks , 1993 .
[988] Yuval Davidor,et al. Genetic Algorithms and Robotics - A Heuristic Strategy for Optimization , 1991, World Scientific Series in Robotics and Intelligent Systems.
[989] Bharatendu Srivastava,et al. Part type selection problem in flexible manufacturing systems: tabu search algorithms , 1993, Ann. Oper. Res..
[990] Michael J. Flynn,et al. Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.
[991] Jun Wang,et al. A feedforward neural network for multiple criteria decision making , 1992, Comput. Oper. Res..
[992] Claude J. P. Bélisle. Convergence theorems for a class of simulated annealing algorithms on ℝd , 1992 .
[993] Pedro Barahona,et al. Heuristics and look-ahead integration to solve constraint satisfaction problems efficiently , 1994, Ann. Oper. Res..
[994] Donald E. Brown,et al. A practical application of simulated annealing to clustering , 1990, Pattern Recognit..
[995] Marco Dorigo,et al. Using transputers to increase speed and flexibility of genetics-based machine learning systems , 1992, Microprocess. Microprogramming.
[996] Minghe Sun,et al. Tabu search applied to the general fixed charge problem , 1993, Ann. Oper. Res..
[997] Abdollah Homaifar,et al. Constrained Optimization Via Genetic Algorithms , 1994, Simul..
[998] Paul McIlroy,et al. Exploring some Commercial Applications of Genetic Programming , 1995, Evolutionary Computing, AISB Workshop.
[999] Bennett L. Fox,et al. Integrating and accelerating tabu search, simulated annealing, and genetic algorithms , 1993, Ann. Oper. Res..
[1000] Kenneth A. De Jong,et al. Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.
[1001] R. Battiti,et al. Local search with memory: benchmarking RTS , 1995 .
[1002] Kalyanmoy Deb,et al. Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.
[1003] J. Corriou,et al. Global optimization by artificial life : a new technique using genetic population evolution , 1994 .
[1004] Jin-Kao Hao,et al. A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems , 1995, ICANNGA.
[1005] Yukinori Kakazu,et al. A Genetic Approach to the Line Balancing Problem , 1992, PROLAMAT.
[1006] Martin Grant,et al. A Fast Algorithm for Simulated Annealing , 1991 .
[1007] Colin Reeves,et al. Hybrid genetic algorithms for bin-packing and related problems , 1996, Ann. Oper. Res..
[1008] Ching-Fang Liaw,et al. A Bibliography of Heuristic Search Research Through 1992 , 1994, IEEE Trans. Syst. Man Cybern. Syst..
[1009] Jin-Kao Hao,et al. Study of Genetic Search for the Frequency Assignment Problem , 1995, Artificial Evolution.
[1010] Hugh M. Cartwright,et al. Simultaneous optimization of chemical flowshop sequencing and topology using genetic algorithms , 1993 .
[1011] Roger L. Wainwright,et al. Terminal assignment in a communications network using genetic algorithms , 1994, CSC '94.
[1012] M. Opper,et al. Statistical mechanics of the knapsack problem , 1994 .
[1013] T. Kampke. Simulated Annealing: use of new tool in bin packing , 1988 .
[1014] Roger L. Wainwright,et al. Manipulating subpopulations of feasible and infeasible solutions in genetic algorithms , 1993, SAC '93.
[1015] B. Adenso-Díaz. Restricted neighborhood in the tabu search for the flowshop problem , 1992 .
[1016] Jean-Yves Potvin,et al. Clustering for vehicle routing with a competitive neural network , 1995, Neurocomputing.
[1017] Lin-Ming Jin,et al. Analogue placement by formulation of macro-components and genetic partitioning , 1992 .
[1018] Rex K. Kincaid,et al. Heuristic Search for the Polymer Straightening Problem , 1995 .
[1019] Anoop K. Dhingra,et al. DISCRETE AND CONTINUOUS VARIABLE STRUCTURAL OPTIMIZATION USING TABU SEARCH , 1995 .
[1020] Gunar E. Liepins,et al. Apga: an adaptive Parallel Genetic Algorithm , 1992, Computer Science and Operations Research.
[1021] Michael C. Ferris,et al. Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem , 1994, INFORMS J. Comput..
[1022] Jennifer Ryan,et al. Path assignment for call routing: An application of tabu search , 1993, Ann. Oper. Res..
[1023] Kendall E. Nygard,et al. School bus routing using genetic algorithms , 1992, Defense, Security, and Sensing.
[1024] Éric D. Taillard,et al. Parallel iterative search methods for vehicle routing problems , 1993, Networks.
[1025] P. Floquet,et al. Scheduling and simulated annealing application to a semiconductor circuit fabrication plant , 1993 .
[1026] Alice E. Smith,et al. A genetic approach to the quadratic assignment problem , 1995, Comput. Oper. Res..
[1027] John N. Hooker,et al. Testing heuristics: We have it all wrong , 1995, J. Heuristics.
[1028] G. L. Blankenship,et al. Optimization based job shop scheduling , 1993 .
[1029] Jean-Yves Potvin,et al. THE TRAVELING SALESMAN PROBLEM: A NEURAL NETWORK PERSPECTIVE , 1993 .
[1030] Mike Wright,et al. A preliminary investigation into the performance of heuristic search methods applied to compound combinatorial problems , 1996 .
[1031] S. Voß,et al. Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms , 1994 .
[1032] C. Ribeiro,et al. A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints , 1995, Int. J. High Speed Comput..
[1033] Rajan Batta,et al. Cell formation using tabu search , 1995 .
[1034] L. Burke. A neural design for solution of the maximal independent set problem , 1992 .
[1035] É. Taillard. COMPARISON OF ITERATIVE SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM. , 1995 .
[1036] Mario Calderini,et al. A hierarchical bicriterion approach to integrated process plan selection and job shop scheduling , 1995 .
[1037] Othar Hansson,et al. Decision-Theoretic Control of Constraint-Satisfaction and Scheduling , 1995 .
[1038] Seiichi Nishihara,et al. A Constraint Satisfaction Algorithm Using Solution Trees and its Complexity , 1992, IWAR.
[1039] Peter Brucker,et al. Complex Sequencing Problems and Local Search Heuristics , 1996 .
[1040] M. Kolonko,et al. A piecewise Markovian model for simulated annealing with stochastic cooling schedules , 1995, Journal of Applied Probability.
[1041] Khalil S. Hindi,et al. Solving the CLSP by a Tabu Search Heuristic , 1996 .
[1042] Alistair I. Mees,et al. Convergence of an annealing algorithm , 1986, Math. Program..
[1043] Philip Kilby,et al. BUDI: A Software System for Bus Dispatching , 1994 .
[1044] J. A. Bland. Discrete-variable optimal structural design using tabu search , 1995 .
[1045] Godfrey A. Walters,et al. EVOLUTIONARY DESIGN ALGORITHM FOR OPTIMAL LAYOUT OF TREE NETWORKS , 1995 .
[1046] Bharatendu Srivastava,et al. Simulated annealing procedures for forming machine cells in group technology , 1994 .
[1047] Robert H. Storer,et al. Datapath synthesis using a problem-space genetic algorithm , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[1048] Roberto Brunelli. Optimal histogram partitioning using a simulated annealing technique , 1992, Pattern Recognit. Lett..
[1049] Frederick E. Petry,et al. Genetic Algorithms , 1992 .
[1050] Jonathan F. Bard,et al. Single machine scheduling with flow time and earliness penalties , 1993, J. Glob. Optim..
[1051] David E. Goldberg,et al. A Note on Boltzmann Tournament Selection for Genetic Algorithms and Population-Oriented Simulated Annealing , 1990, Complex Syst..
[1052] C. Reeves. Modern heuristic techniques for combinatorial problems , 1993 .
[1053] Mansur R. Kabuka,et al. A Boolean Neural Network Approach for the Traveling Salesman Problem , 1993, IEEE Trans. Computers.
[1054] Jonathan F. Bard,et al. A GRASP for the Vehicle Routing Problem with Time Windows , 1995, INFORMS J. Comput..
[1055] J. Current,et al. An efficient tabu search procedure for the p-Median Problem , 1997 .
[1056] Colin R. Reeves,et al. Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .
[1057] Chris N. Potts,et al. Single Machine Tardiness Sequencing Heuristics , 1991 .
[1058] M. Gen,et al. Evolution program for bicriteria transportation problem , 1994 .
[1059] Emanuel Falkenauer,et al. Solving Equal Piles with the Grouping Genetic Algorithm , 1995, ICGA.
[1060] Emile H. L. Aarts,et al. Global optimization and simulated annealing , 1991, Math. Program..
[1061] J. Shang. Multicriteria facility layout problem: An integrated approach , 1993 .
[1062] D. Mitra,et al. Convergence and finite-time behavior of simulated annealing , 1986, Advances in Applied Probability.
[1063] Thomas E. Morton,et al. Guided Forward Search in Tardiness Scheduling of Large One Machine Problems , 1995 .
[1064] Giuseppe Berio,et al. The M*-OBJECT methodology for information system design in CIM environments , 1995, IEEE Trans. Syst. Man Cybern..
[1065] Marc Schoenauer,et al. Constrained GA Optimization , 1993, ICGA.
[1066] A. Alfa,et al. Experimental analysis of simulated annealing based algorithms for the layout problem , 1992 .
[1067] Kathryn A. Dowsland. Simple Tabu Thresholding and the Pallet Loading Problem. , 1996 .
[1068] Tevfik Bultan,et al. Circuit partitioning using mean field annealing , 1995, Neurocomputing.
[1069] Guido Deboeck,et al. Trading on the Edge: Neural, Genetic, and Fuzzy Systems for Chaotic Financial Markets , 1994 .
[1070] David Abramson,et al. Constructing school timetables using simulated annealing: sequential and parallel algorithms , 1991 .
[1071] John R. Koza,et al. Genetic Programming II , 1992 .
[1072] J.-F. Puget. Object oriented constraint programming for transportation problems , 1993 .
[1073] Fred Glover,et al. Genetic algorithms and scatter search: unsuspected potentials , 1994 .
[1074] Mike Wright,et al. Timetabling County Cricket Fixtures Using a Form of Tabu Search , 1994 .
[1075] Manuel Laguna,et al. Clustering for the design of SONET rings in interoffice telecommunications , 1994 .
[1076] D. Werra,et al. Tabu search: a tutorial and an application to neural networks , 1989 .
[1077] I. B. Crabtree. Resource scheduling: comparing simulated annealing with constraint programming , 1995 .
[1078] Günter Rudolph,et al. Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.
[1079] S. Sahu,et al. Multiobjective facility layout using simulated annealing , 1993 .
[1080] Yuval Lirov,et al. Knowledge based approach to the cutting stock problem , 1992 .
[1081] Hideo Tanaka,et al. Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems , 1994 .
[1082] Fred W. Glover,et al. Tabu search for graph partitioning , 1996, Ann. Oper. Res..
[1083] Bryant A. Julstrom,et al. Seeding the population: improved performance in a genetic algorithm for the rectilinear Steiner problem , 1993, SAC '94.
[1084] Alessandro De Gloria,et al. Design of a massively parallel SIMD architecture for the Boltzmann machine , 1993, Microprocess. Microprogramming.
[1085] Gérard Dreyfus,et al. Placement and channel routing by simulated annealing: some recent developments , 1989 .
[1086] Jean-Yves Potvin,et al. The Clustered Traveling Salesman Problem: A Genetic Approach , 1996 .
[1087] N. E. Collins,et al. Simulated annealing - an annotated bibliography , 1988 .
[1088] S. Iyengar,et al. Bin-packing by simulated annealing , 1994 .
[1089] Rina Dechter,et al. Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..
[1090] Domenico Parisi,et al. Recombination and unsupervised learning: effects of crossover in the genetic optimization of neural networks , 1992 .
[1091] James P. Ignizio,et al. Neural networks and operations research: An overview , 1992, Comput. Oper. Res..
[1092] Amit Gupta,et al. Estimating Missing Values Using Neural Networks , 1996 .
[1093] B. Jaumard,et al. A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives , 1994 .
[1094] 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.
[1095] A. F. Da Rocha,et al. Neural Nets: A Theory for Brains and Machines , 1992 .
[1096] Vipul Gupta,et al. Annealed Embeddings of Communication Patterns in an Interconnection Cached Network , 1995, IEEE Trans. Parallel Distributed Syst..
[1097] Wen-Chyuan Chiang,et al. Heuristic unidirectional flowpath design approaches for automated guided vehicle systems , 1992 .
[1098] Carsten Peterson,et al. Neural Networks and NP-complete Optimization Problems; A Performance Study on the Graph Bisection Problem , 1988, Complex Syst..
[1099] George Harhalakis,et al. CLASS: Computerized LAyout Solutions using Simulated annealing , 1992 .
[1100] Brigitte Jaumard,et al. Local Optima Topology for the k-Coloring Problem , 1991, Discret. Appl. Math..
[1101] Alice E. Smith,et al. Genetic Optimization Using A Penalty Function , 1993, ICGA.
[1102] Vasant Dhar,et al. A Knowledge Representation for Constraint Satisfaction Problems , 1990, IEEE Trans. Knowl. Data Eng..
[1103] Manfred M. Fischer,et al. ARTIFICIAL NEURAL NETWORKS: A NEW APPROACH TO MODELING INTERREGIONAL TELECOMMUNICATION FLOWS* , 1994 .
[1104] Michael F. Wehner,et al. Mathematical comparison of combat computer models to exercise data , 1991 .
[1105] J. Pospíchal,et al. Messy simulated annealing , 1995 .
[1106] Wesley E. Snyder,et al. Optimization of functions with many minima , 1991, IEEE Trans. Syst. Man Cybern..
[1107] Pinaki Mazumder,et al. VLSI cell placement techniques , 1991, CSUR.
[1108] G. D. Smith,et al. Solving the Graphical Steiner Tree Problem Using Genetic Algorithms , 1993 .
[1109] G. Syswerda,et al. Schedule Optimization Using Genetic Algorithms , 1991 .
[1110] Richard W. Eglese,et al. Routeing Winter Gritting Vehicles , 1994, Discret. Appl. Math..
[1111] Jaydeep Balakrishnan,et al. Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison , 1995 .
[1112] Erwin Pesch,et al. Fast Clustering Algorithms , 1994, INFORMS J. Comput..
[1113] Peter J. Bentley,et al. The Evolution of Solid Object Designs using Genetic Algorithms , 1995 .
[1114] Yuehwern Yih,et al. Determining the number of kanbans and lotsizes in a generic kanban system : a simulated annealing approach , 1994 .
[1115] Seok J. Koh,et al. A tabu search for the survivable fiber optic communication network design , 1995 .
[1116] Roy George,et al. A variable-length genetic algorithm for clustering and classification , 1995, Pattern Recognit. Lett..
[1117] Robert L. Bulfin,et al. Simulated annealing for resource-constrained scheduling , 1993 .
[1118] Karl Heinz Hoffmann,et al. Optimizing Complex Problems by Nature's Algorithms: Simulated Annealing and Evolution Strategy - A Comparative Study , 1990, PPSN.
[1119] Bruce E. Hajek,et al. The time complexity of maximum matching by simulated annealing , 1988, JACM.
[1120] Kenneth A. De Jong,et al. On the State of Evolutionary Computation , 1993, ICGA.
[1121] L. Tao,et al. Effective heuristic algorithms for VLSI-circuit partition , 1993 .
[1122] Geoffrey C. Fox,et al. Allocating data to multicomputer nodes by physical optimization algorithms for loosely synchronous computations , 1992, Concurr. Pract. Exp..
[1123] Chuck Zhang,et al. Implementation and Comparison of Three Neural Network Learning Algorithms , 1993 .
[1124] Sheldon Howard Jacobson,et al. Cybernetic Optimization by Simulated Annealing: An Implementation of Parallel Processing Using Probabilistic Feedback Control , 1996 .
[1125] Mark A. Franklin,et al. Simulated annealing on a multiprocessor , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.
[1126] M. Narasimha Murty,et al. A genetic approach for selection of (near-) optimal subsets of principal components for discrimination , 1995, Pattern Recognit. Lett..
[1127] Chin-Teng Lin,et al. A multi-valued Boltzmann machine , 1995, IEEE Trans. Syst. Man Cybern..
[1128] Catherine Roucairol,et al. A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .
[1129] Jean-Yves Potvin,et al. The Vehicle Routing Problem with Time Windows Part I: Tabu Search , 1996, INFORMS J. Comput..
[1130] Bogdan Filipic,et al. Enhancing Genetic Search to Schedule a Production Unit , 1993, ECAI.
[1131] Roman Słowiński,et al. DSS for multiobjective project scheduling , 1994 .
[1132] L. Darrell Whitley,et al. GENITOR II: a distributed genetic algorithm , 1990, J. Exp. Theor. Artif. Intell..
[1133] Jonathan F. Bard,et al. A GRASPTM for a difficult single machine scheduling problem, , 1991, Comput. Oper. Res..
[1134] Prügel-Bennett,et al. Analysis of genetic algorithms using statistical mechanics. , 1994, Physical review letters.
[1135] Donald R. Jones,et al. Solving Partitioning Problems with Genetic Algorithms , 1991, International Conference on Genetic Algorithms.
[1136] Patric R. J. Östergård,et al. New Upper Bounds for the Football Pool Problem for 11 and 12 Matches , 1994, J. Comb. Theory, Ser. A.
[1137] F. Curatelli,et al. Implementation and evaluation of genetic algorithms for system partitioning , 1995 .
[1138] Wan Ahmad Tajuddin. Seeking Global Minima , 1994 .
[1139] Geoffrey C. Fox,et al. Constrained Clustering as an Optimization Method , 1993, IEEE Trans. Pattern Anal. Mach. Intell..
[1140] Dirk Van Gucht,et al. Parallel Genetic Algorithms Applied to the Traveling Salesman Problem , 1991, SIAM J. Optim..
[1141] Nicos Christofides,et al. Capacitated clustering problems by hybrid simulated annealing and tabu search , 1994 .
[1142] Ehl Emile Aarts,et al. A Probabilistic Analysis of Local Search , 1996 .
[1143] Yasuhiko Kitamura,et al. Parallel Genetic Algorithms Based on a Multiprocessor System FIN and Its Application , 1995 .
[1144] Larry W. Jacobs,et al. A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems , 1993 .
[1145] Joseph B. Mazzola,et al. A tabu-search heuristic for the flexible-resource flow shop scheduling problem , 1993, Ann. Oper. Res..
[1146] Andrew Sohn. Generalized speculative computation of parallel simulated annealing , 1996, Ann. Oper. Res..
[1147] Richard P. Lippmann,et al. An introduction to computing with neural nets , 1987 .
[1148] Christos Koulamas,et al. A survey of simulated annealing applications to operations research problems , 1994 .
[1149] Robert A. Russell,et al. Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..
[1150] Percy P. C. Yip,et al. A Guided Evolutionary Simulated Annealing Approach to the Quadratic Assignment Problem , 1994, IEEE Trans. Syst. Man Cybern. Syst..
[1151] Hsinchun Chen. Machine learning for information retrieval: neural networks, symbolic learning, and genetic algorithms , 1995 .
[1152] David Beasley,et al. An overview of genetic algorithms: Part 1 , 1993 .
[1153] Wonchan Kim,et al. Combined hierarchical placement algorithm for row-based layouts , 1993 .
[1154] József Váncza,et al. Genetic algorithms in process planning , 1991 .
[1155] L. Miclo,et al. Remarques sur l'ergodicit des algorithmes de recuit simul sur un graphe , 1995 .
[1156] Chinchuan Chiu,et al. An Artificial Neural Network Algorithm for Dynamic Programming , 1990, Int. J. Neural Syst..
[1157] Charles Fleurent,et al. Genetic and hybrid algorithms for graph coloring , 1996, Ann. Oper. Res..
[1158] Vittorio Maniezzo,et al. Genetic evolution of the topology and weight distribution of neural networks , 1994, IEEE Trans. Neural Networks.
[1159] Charles J. Malmborg,et al. Optimization of cube-per-order index warehouse layouts with zoning constraints , 1995 .
[1160] Rammile Ettelaie,et al. Zero-temperature scaling and simulated annealing , 1987 .
[1161] Pierre Hansen,et al. Heuristic reliability optimization by tabu search , 1996, Ann. Oper. Res..
[1162] A. J. Keane,et al. Genetic algorithm optimization of multi-peak problems: studies in convergence and robustness , 1995, Artif. Intell. Eng..
[1163] Michel Gendreau,et al. Diversification strategies in tabu search algorithms for the maximum clique problem , 1996, Ann. Oper. Res..
[1164] Yasuo Matsuyama,et al. Self-organizing neural networks and various euclidean traveling salesman problems , 1992, Systems and Computers in Japan.
[1165] Karl Heinz Hoffmann,et al. Scaling behaviour of optimal simulated annealing schedules , 1993 .
[1166] Mauro Piccioni,et al. A combined multistart-annealing algorithm for continuous global optimization , 1991 .
[1167] G. Srinivasan,et al. Fractional cell formation in group technology , 1995 .
[1168] Marco Dorigo,et al. Implicit Parallelism in Genetic Algorithms , 1993, Artif. Intell..
[1169] Joe Suzuki,et al. A Markov chain analysis on simple genetic algorithms , 1995, IEEE Trans. Syst. Man Cybern..
[1170] Ronald Morrison,et al. Applications of Neural Networks in Finance , 1994 .
[1171] Xingzhao Liu,et al. A Modified Genetic Channel Router , 1994 .
[1172] F. Glover. Scatter search and star-paths: beyond the genetic metaphor , 1995 .
[1173] Kathryn A. Dowsland,et al. Variants of simulated annealing for the examination timetabling problem , 1996, Ann. Oper. Res..
[1174] J. A. Bland,et al. Large-scale layout of facilities using a heuristic hybrid algorithm , 1994 .
[1175] Rex K. Kincaid. Good solutions to discrete noxious location problems via metaheuristics , 1992, Ann. Oper. Res..
[1176] Chrisila C. Pettey,et al. A Theoretical Investigation of a Parallel Genetic Algorithm , 1989, ICGA.
[1177] Kathryn A. Dowsland,et al. A family of genetic algorithms for the pallet loading problem , 1996, Ann. Oper. Res..
[1178] J. Kalivas,et al. EXCHANGE OF COMMENTS ON CONVERGENCE OF GENERALIZED SIMULATED ANNEALING WITH VARIABLE STEP SIZE WITH APPLICATION TOWARD PARAMETER ESTIMATIONS OF LINEAR AND NONLINEAR MODELS : AUTHOR'S REPLY , 1992 .
[1179] A. Kahng,et al. Best-so-far vs. where-you-are: implications for optimal finite-time annealing , 1994 .
[1180] Yash P. Gupta,et al. Minimizing flow time variance in a single machine system using genetic algorithms , 1993 .
[1181] Michael Conlon. The controlled random search procedure for function optimization , 1992 .
[1182] Yves Rochat,et al. Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.
[1183] J. Wang. Recurrent neural network for solving quadratic programming problems with equality constraints , 1992 .
[1184] Ian C. Parmee,et al. The Ant Colony Metaphor for Searching Continuous Design Spaces , 1995, Evolutionary Computing, AISB Workshop.
[1185] Pablo Moscato,et al. An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search , 1993, Ann. Oper. Res..
[1186] João Vitor Moccellin,et al. A New Heuristic Method for the Permutation Flow Shop Scheduling Problem , 1995 .
[1187] FEDERICO DELLA CROCE,et al. A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..
[1188] D. Fogel. ASYMPTOTIC CONVERGENCE PROPERTIES OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING: ANALYSIS AND EXPERIMENTS , 1994 .
[1189] Robert L. Smith,et al. Simulated annealing for constrained global optimization , 1994, J. Glob. Optim..
[1190] Hideo Tanaka,et al. Modified simulated annealing algorithms for the flow shop sequencing problem , 1995 .
[1191] Erik Rolland,et al. New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation , 1994, Comput. Oper. Res..
[1192] Philip Husbands,et al. An ecosystems model for integrated production planning , 1993 .
[1193] Xingzhao Liu,et al. Restrictive Channel Routing with Evolution Programs , 1993 .
[1194] Roberto Battiti,et al. Parallel biased search for combinatorial optimization: genetic algorithms and TABU , 1992, Microprocess. Microsystems.
[1195] Patrick D. Surry,et al. A Multi-objective Approach to Constrained Optimisation of Gas Supply Networks: the COMOGA Method , 1995, Evolutionary Computing, AISB Workshop.
[1196] Rina Dechter,et al. Network-Based Heuristics for Constraint-Satisfaction Problems , 1987, Artif. Intell..
[1197] Eugene C. Freuder,et al. The Complexity of Constraint Satisfaction Revisited , 1993, Artif. Intell..
[1198] M. F. Cardoso,et al. Nonequilibrium simulated annealing : a faster approach to combinatorial minimization , 1994 .
[1199] H. van Hove,et al. Genetic algorithms and trees: part 1: recognition trees (the fixed width case) , 1994 .
[1200] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[1201] Fred W. Glover,et al. The general employee scheduling problem. An integration of MS and AI , 1986, Comput. Oper. Res..
[1202] Zbigniew Michalewicz,et al. Handling Constraints in Genetic Algorithms , 1991, ICGA.
[1203] Zbigniew Michalewicz,et al. Evolutionary Computation Techniques for Nonlinear Programming Problems , 1994 .
[1204] Abraham P. Punnen,et al. A Tabu Search Algorithm for the Resource-Constrained Assignment Problem , 1995 .
[1205] Frédéric Gruau,et al. Automatic Definition of Modular Neural Networks , 1994, Adapt. Behav..
[1206] Chingwei Yeh,et al. Optimization by iterative improvement: an experimental evaluation on two-way partitioning , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[1207] Andreas Ostermeier,et al. An Evolution Strategy with Momentum Adaptation of the Random Number Distribution , 1992, PPSN.
[1208] Stefen Hui,et al. On solving constrained optimization problems with neural networks: a penalty method approach , 1993, IEEE Trans. Neural Networks.
[1209] Xin Yao,et al. A review of evolutionary artificial neural networks , 1993, Int. J. Intell. Syst..
[1210] J. D. Schaffer,et al. Combinations of genetic algorithms and neural networks: a survey of the state of the art , 1992, [Proceedings] COGANN-92: International Workshop on Combinations of Genetic Algorithms and Neural Networks.
[1211] Robert F. Harrison,et al. Optimization and training of feedforward neural networks by genetic algorithms , 1991 .
[1212] Alex Van Breedam,et al. Improvement heuristics for the Vehicle Routing Problem based on simulated annealing , 1995 .
[1213] Thomas Bäck,et al. Basic aspects of evolution strategies , 1994 .
[1214] Michel Gendreau,et al. Solving the maximum clique problem using a tabu search approach , 1993, Ann. Oper. Res..
[1215] Jan Karel Lenstra,et al. Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows , 1993, Transp. Sci..
[1216] Jan Paredis,et al. Exploiting Constraints as Background Knowledge for Genetic Algorithms: A Case-Study for Scheduling , 1992, PPSN.
[1217] Celso C. Ribeiro,et al. Location and sizing of offshore platforms for oil exploration , 1992 .