INDUSTRIAL PATTERN SEQUENCING PROBLEMS: SOME COMPLEXITY RESULTS AND NEW LOCAL SEARCH MODELS
暂无分享,去创建一个
[1] Andrew B. Kahng,et al. A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..
[2] Microcanonical Optimization Applied to the Traveling Salesman Problem , 1998 .
[3] Roberto Baldacci,et al. A Bionomic Approach to the Capacitated p-Median Problem , 1998, J. Heuristics.
[4] C. A. Bentivoglio,et al. Heuristic and exact methods for the cutting sequencing problem , 1998, Eur. J. Oper. Res..
[5] Yu Hen Hu,et al. GM-Learn: an iterative learning algorithm for CMOS gate matrix layout , 1990 .
[6] J. Bard. A Heuristic for Minimizing the Number of Tool Switches on a Flexible Machine , 1988 .
[7] Michael Creutz,et al. Microcanonical Monte Carlo Simulation , 1983 .
[8] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[9] Yu Hen Hu,et al. GM Plan: a gate matrix layout algorithm based on artificial intelligence planning techniques , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[10] Vineet Bafna,et al. Genome Rearrangements and Sorting by Reversals , 1996, SIAM J. Comput..
[11] Edward Roe,et al. Microcanonical optimization applied to visual processing , 1995 .
[12] José R. A. Torreão,et al. Matching photometric-stereo images , 1998 .
[13] Gerhard Wäscher,et al. Simulated annealing for order spread minimization in sequencing cutting patterns , 1998, Eur. J. Oper. Res..
[14] Zsolt Tuza,et al. Narrowness, pathwidth, and their application in natural language processing , 1992, Discret. Appl. Math..
[15] King-Tim Mak,et al. Distances Between Traveling Salesman Tours , 1995, Discret. Appl. Math..
[16] Nancy G. Kinnersley,et al. The Vertex Separation Number of a Graph equals its Path-Width , 1992, Inf. Process. Lett..
[17] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[18] David Sankoff,et al. Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement , 1995, Algorithmica.
[19] Sheldon Howard Jacobson,et al. The Theory and Practice of Simulated Annealing , 2003, Handbook of Metaheuristics.
[20] Michael R. Fellows,et al. Nonconstructive Advances in Polynomial-Time Complexity , 1987, Inf. Process. Lett..
[21] Rolf H. Möhring,et al. Graph Problems Related to Gate Matrix Layout and PLA Folding , 1990 .
[22] Stephen T. Barnard,et al. Stereo Matching by Hierarchical, Microcanonical Annealing , 1987, IJCAI.
[23] Pavel A. Pevzner,et al. Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals , 1999, J. ACM.
[24] Martin Aigner,et al. Sorting by insertion of leading elements , 1987, J. Comb. Theory, Ser. A.
[25] Boon J. Yuen. Heuristics for sequencing cutting patterns , 1991 .
[26] Frits C. R. Spieksma,et al. Minimizing the number of tool switches on a flexible machine , 1994 .
[27] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[28] Kenneth V. Richardson,et al. Establishing the optimality of sequencing heuristics for cutting stock problems , 1995 .
[29] Alberto Caprara,et al. Sorting Permutations by Reversals and Eulerian Cycle Decompositions , 1999, SIAM J. Discret. Math..
[30] A. Kahng,et al. Best-so-far vs. where-you-are: implications for optimal finite-time annealing , 1994 .
[31] J. J. Hopfield,et al. “Neural” computation of decisions in optimization problems , 1985, Biological Cybernetics.
[32] John R. Ray,et al. SIMULATED ANNEALING IN THE MICROCANONICAL ENSEMBLE , 1997 .
[33] Min-You Wu,et al. Improved net merging method for gate matrix layout , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[34] Nicholas W. Trân. An Easy Case of Sorting by Reversals , 1998, J. Comput. Biol..
[35] Riccardo Poli,et al. New ideas in optimization , 1999 .
[36] Michael R. Fellows,et al. Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.
[37] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[38] Michael R. Fellows,et al. FIXED-PARAMETER TRACTABILITY AND COMPLETENESS , 2022 .
[39] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[40] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.
[41] Donald E. Knuth,et al. Sorting and Searching , 1973 .
[42] Alexandre Linhares,et al. A glimpse at the metaphysics of Bongard problems , 2000, Artif. Intell..
[43] C. R. Reeves,et al. Landscapes, operators and heuristic search , 1999, Ann. Oper. Res..
[44] Christos H. Papadimitriou,et al. Searching and Pebbling , 1986, Theor. Comput. Sci..
[45] J. P. Kelly,et al. Meta-heuristics : theory & applications , 1996 .
[46] Christos H. Papadimitriou,et al. Interval graphs and seatching , 1985, Discret. Math..
[47] Horacio Hideki Yanasse. On a pattern sequencing problem to minimize the maximum number of open stacks , 1997, Eur. J. Oper. Res..
[48] A.D. Lopez,et al. A dense gate matrix layout method for MOS VLSI , 1980, IEEE Transactions on Electron Devices.
[49] E. Kuh,et al. One-dimensional logic gate assignment and interval graphs , 1979, COMPSAC.
[50] Rui Wang,et al. Gate Matrix Layout , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[51] K. H. Hoffmann,et al. Optimization by Thermal Cycling , 2005 .
[52] Hui Zhang,et al. Image segmentation using evolutionary computation , 1999, IEEE Trans. Evol. Comput..
[53] C. Y. Roger Chen,et al. From logic to symbolic layout for gate matrix , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[54] Thomas Lengauer. Black-white pebbles and graph separation , 2004, Acta Informatica.
[55] Stephen T. Barnard,et al. Stochastic stereo matching over scale , 1989, International Journal of Computer Vision.
[56] Oli B.G. Madsen. An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry , 1988 .
[57] Fedor V. Fomin,et al. Helicopter Search Problems, Bandwidth and Pathwidth , 1998, Discret. Appl. Math..
[58] Vineet Bafna,et al. Sorting by Transpositions , 1998, SIAM J. Discret. Math..
[59] Michael A. Langston,et al. Exact and Approximate Solutions for the Gate Matrix Layout Problem , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[60] Christopher S. Tang,et al. Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches , 1988, Oper. Res..
[61] Boon J. Yuen. Improved heuristics for sequencing cutting patterns , 1995 .
[62] Bernd Freisleben,et al. Fitness landscapes and memetic algorithm design , 1999 .
[63] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[64] Shietung Peng,et al. A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions , 1999, Theor. Comput. Sci..
[65] Michel Gourgand,et al. A new heuristic based on a hypergraph representation for the tool switching problem , 2000 .
[66] Horacio Hideki Yanasse,et al. Linear gate assignment: a fast statistical mechanics approach , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[67] Stefan Voß,et al. Applications of modern heuristic search methods to pattern sequencing problems , 1999, Comput. Oper. Res..
[68] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .