Applications of Modern Heuristic Search Methods to Pattern Sequencing Problems (1999)

by Andreas Fink , Stefan Voß
Venue:COMPUTERS & OPERATIONS RESEARCH
Citations:21 - 6 self

Documents Related by Co-Citation

40 Graph problems related to gate matrix layout and PLA folding – - 1990
7 Heuristic and exact methods for the cutting sequencing problem – - 1998
1134 Algorithmic Graph Theory and Perfect Graphs – - 1980
7 Solving General Ring Network Design Problems by Meta-Heuristics
6 Connection between cutting-pattern sequencing, VLSI design and flexible machines
20 The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs – - 1999
3559 Optimization by simulated annealing – - 1983
3 A.: A multiple population evolutionary approach to gate matrix layout, Int – - 2004
29 Schedule optimization using genetic algorithms Handbook of Genetic Algorithms – - 1991
5 Industrial Pattern Sequencing Problems: some complexity results and new local search models – - 2001
8 A constructive genetic algorithm for gate matrix layout problems. Computer-Aided Design of Integrated Circuits and Systems – - 2002
121 Scatter Search and Path Relinking – - 1999
72 PDDL2.2: The language for the classical part of the 4th international planning competition, january 21 – - 2004
436 PDDL2.1: An extension to PDDL for expressing temporal planning domains – - 2003
15 NP-completness of the problem of finding a minimum clique number interval graph containing a given graph as asubgraph – - 1979
3 Benchmarks for basic scheduling instances – - 1993
1971 Genetic algorithms + data structures = evolution programs – - 1996
207 Variable Neighborhood Search – - 1997
4 Steiner Tree Heuristics – A Survey – - 1994