Algorithms and Metaheuristics for Combinatorial Matrices

[1]  Panos M. Pardalos,et al.  D-optimal matrices via quadratic integer optimization , 2013, J. Heuristics.

[2]  P. Pardalos,et al.  Competent genetic algorithms for weighing matrices , 2012, J. Comb. Optim..

[3]  Michael N. Vrahatis,et al.  Ant-Based Approaches for Solving Autocorrelation Problems , 2012, ANTS.

[4]  Ioannis Konstantaras,et al.  Solving the stochastic dynamic lot-sizing problem through nature-inspired heuristics , 2012, Comput. Oper. Res..

[5]  Michael N. Vrahatis,et al.  MEMPSODE: A global optimization software based on hybridization of population-based algorithms and local searches , 2012, Comput. Phys. Commun..

[6]  Panos M. Pardalos,et al.  A modified power spectral density test applied to weighing matrices with small weight , 2011, J. Comb. Optim..

[7]  Panos M. Pardalos,et al.  D-Optimal Designs: A Mathematical Programming Approach Using Cyclotomic Cosets , 2011, Informatica.

[8]  Warwick de Launey,et al.  Algebraic Design Theory , 2011 .

[9]  Dragomir Ž. Đoković,et al.  Cyclic (v; r, s; λ) Difference Families with Two Base Blocks and v ≤ 50 , 2011 .

[10]  Ilias S. Kotsireas,et al.  New Results on D‐Optimal Matrices , 2011, 1103.3626.

[11]  Dragomir Ž. Đoković,et al.  Classification of Normal Sequences , 2011 .

[12]  Tao Feng,et al.  Cyclotomic constructions of skew Hadamard difference sets , 2011, J. Comb. Theory, Ser. A.

[13]  Tao Feng,et al.  Strongly regular graphs from unions of cyclotomic classes , 2010, J. Comb. Theory, Ser. B.

[14]  Kathy J. Horadam,et al.  Hadamard matrices and their applications: Progress 2007–2010 , 2010, Cryptography and Communications.

[15]  Panos M. Pardalos,et al.  Periodic complementary binary sequences and Combinatorial Optimization algorithms , 2010, J. Comb. Optim..

[16]  David A. Levin,et al.  A Fourier-analytic approach to counting partial Hadamard matrices , 2010, Cryptography and Communications.

[17]  D. Dokovic.  On the base sequence conjecture , 2010, Discret. Math..

[18]  Michael N. Vrahatis,et al.  Particle Swarm Optimization and Intelligence: Advances and Applications , 2010 .

[19]  Jennifer Seberry,et al.  Weighing Matrices and String Sorting , 2009 .

[20]  Shu Lin,et al.  Applied Algebra, Algebraic Algorithms and Error-Correcting Codes , 2009, Lecture Notes in Computer Science.

[21]  Luís Paquete,et al.  Heuristic algorithms for Hadamard matrices with two circulant cores , 2008, Theor. Comput. Sci..

[22]  Matthew G. Parker,et al.  A multi-dimensional approach to the construction and enumeration of Golay complementary sequences , 2008, J. Comb. Theory, Ser. A.

[23]  D. Đoković.  Hadamard matrices of order 764 exist , 2008 .

[24]  Matthew G. Parker,et al.  A Framework for the Construction ofGolay Sequences , 2008, IEEE Transactions on Information Theory.

[25]  Chukwudi Anyakoha,et al.  A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications , 2008, Natural Computing.

[26]  Chukwudi Anyakoha,et al.  A review of particle swarm optimization. Part I: background and development , 2007, Natural Computing.

[27]  Michael N. Vrahatis,et al.  Parameter selection and adaptation in Unified Particle Swarm Optimization , 2007, Math. Comput. Model..

[28]  D. Djoković,et al.  Skew‐Hadamard matrices of orders 436, 580, and 988 exist , 2007, 0706.1973.

[29]  D. Djoković,et al.  Skew-Hadamard matrices of orders 188 and 388 exist , 2007, 0704.0640.

[30]  Michael N. Vrahatis,et al.  Studying the Performance of Unified Particle Swarm Optimization on the Single Machine Total Weighted Tardiness Problem , 2006, Australian Conference on Artificial Intelligence.

[31]  K. Horadam.  Hadamard Matrices and Their Applications , 2006 .

[32]  C. Colbourn,et al.  Handbook of Combinatorial Designs , 2006 .

[33]  R. Brualdi.  Combinatorial Matrix Classes , 2006 .

[34]  Jennifer Seberry,et al.  Hadamard ideals and Hadamard matrices with two circulant cores , 2006, Eur. J. Comb..

[35]  Yury J. Ionin,et al.  Combinatorics of Symmetric Designs , 2006 .

[36]  Víctor Álvarez,et al.  A Genetic Algorithm for Cocyclic Hadamard Matrices , 2006, AAECC.

[37]  Andries Petrus Engelbrecht,et al.  Fundamentals of Computational Swarm Intelligence , 2005 .

[38]  Behruz Tayfeh-Rezaie,et al.  A Hadamard matrix of order 428 , 2005 .

[39]  Jennifer Seberry,et al.  On some applications of Hadamard matrices , 2005 .

[40]  Luis B. Morales,et al.  Constructing cyclic PBIBD(2)s through an optimization approach: Thirty‐two new cyclic designs , 2005 .

[41]  Michael N. Vrahatis,et al.  Optimal power allocation and joint source-channel coding for wireless DS-CDMA visual sensor networks using the Nash Bargaining Solution , 2005, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[42]  Ilias S. Kotsireas,et al.  Genetic algorithms for the construction of Hadamard matrices with two circulant cores , 2005 .

[43]  Thomas Stützle,et al.  Stochastic Local Search: Foundations & Applications , 2004 .

[44]  Douglas R Stinson.  Combinatorial designs: constructions and analysis , 2003, SIGA.

[45]  Robert Craigen,et al.  Boolean and ternary complementary pairs , 2003, J. Comb. Theory, Ser. A.

[46]  Peter B. Borwein,et al.  A complete description of Golay pairs for lengths up to 100 , 2003, Math. Comput..

[47]  Joe Sawada,et al.  A fast algorithm to generate necklaces with fixed content , 2003, Theor. Comput. Sci..

[48]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

[49]  Connie M. Borror,et al.  Genetic Algorithms for the Construction of D-Optimal Designs , 2003 .

[50]  S. Yau.  Mathematics and its applications , 2002 .

[51]  M. N. Vrahatis,et al.  Recent approaches to global optimization problems through Particle Swarm Optimization , 2002, Natural Computing.

[52]  Luis B. Morales,et al.  Constructing difference families through an optimization approach: Six new BIBDs , 2000 .

[53]  Thomas Stützle,et al.  MAX-MIN Ant System , 2000, Future Gener. Comput. Syst..

[54]  Dragomir Z. Dokovic,et al.  Equivalence classes and representatives of Golay sequences , 1998, Discret. Math..

[55]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[56]  John Erik Hershey,et al.  Hadamard matrix analysis and synthesis , 1996 .

[57]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[58]  Dragomir Ž. Đoković,et al.  Two Hadamard matrices of order 956 of Goethals-Seidel type , 1994 .

[59]  Jennifer Seberry,et al.  Pitfalls in Designing Substitution Boxes (Extended Abstract) , 1994, CRYPTO.

[60]  Abraham Lempel,et al.  On ternary complementary sequences , 1994, IEEE Trans. Inf. Theory.

[61]  J. A. John,et al.  CONSTRUCTION OF RESOLVABLE ROW-COLUMN DESIGNS USING SIMULATED ANNEALING , 1993 .

[62]  Mieko Yamada,et al.  Supplementary difference sets and Jacobi sums , 1992, Discret. Math..

[63]  R. Brualdi,et al.  Combinatorial Matrix Theory , 1991 .

[64]  Leopold Bömer,et al.  Periodic complementary binary sequences , 1990, IEEE Trans. Inf. Theory.

[65]  Michel Kervaire,et al.  A new restriction on the lengths of golay complementary sequences , 1990, J. Comb. Theory A.

[66]  R. K. Meyer,et al.  Constructing exact D-optimal experimental designs by simulated annealing , 1988 .

[67]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[68]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[69]  W. Wallis,et al.  Hadamard Matrices and Their Applications , 1978 .

[70]  Jennifer Wallis,et al.  A note on supplementary difference sets , 1973 .

[71]  Jennifer Wallis,et al.  On supplementary difference sets , 1972 .

[72]  H. E. Slaught.  THE CARUS MATHEMATICAL MONOGRAPHS , 1923 .

[73]  Konstantina Skouri,et al.  The IX Metaheuristics International Conference S 1 – 37 – 1 Applying PSO and DE on Multi – Item Inventory Problem with Supplier Selection , 2011 .

[74]  Panos M. Pardalos,et al.  An efficient string sorting algorithm for weighing matrices of small weight , 2010, Optim. Lett..

[75]  J. Jedwab,et al.  A Framework for the Construction of Golay Sequences , 2008 .

[76]  Luis B. Morales,et al.  Constructing 1-rotational NRDFs through an Optimization Approach : New ( 46 , 9 , 8 ) , 2007 .

[77]  Yaakov Tsaig,et al.  Extensions of compressed sensing , 2006, Signal Process..

[78]  R. Eberhart,et al.  Particle Swarm Optimization-Neural Networks, 1995. Proceedings., IEEE International Conference on , 2004 .

[79]  Marco Dorigo.  Ant Colony Optimization , 2004, IEEE Transactions on Evolutionary Computation.

[80]  William H. Wilson,et al.  Two-stage generalized simulated annealing for the construction of change-over designs , 2003 .

[81]  J. Kennedy,et al.  The Particle Swarm : Explosion , Stability , and Convergence in a Multi-Dimensional Complex Space , 2003 .

[82]  Jennifer Seberry,et al.  Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices , 2001, Australas. J Comb..

[83]  Joe Sawada,et al.  Generating Bracelets in Constant Amortized Time , 2001, SIAM J. Comput..

[84]  Marco Dorigo,et al.  The ant colony optimization meta-heuristic , 1999 .

[85]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[86]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[87]  Marc Gysin,et al.  Combinatorial designs, sequences and cryptography , 1997 .

[88]  Zbigniew Michalewicz,et al.  Handbook of Evolutionary Computation , 1997 .

[89]  Daniel Ashlock,et al.  Finding Designs with Genetic Algorithms , 1996 .

[90]  M. Dorigo,et al.  The Ant System: Optimization by a colony of cooperating agents , 1996 .

[91]  W. D. Wallis,et al.  Computational and constructive design theory , 1996 .

[92]  Jennifer Seberry,et al.  Cryptographic Boolean functions via group Hadamard matrices , 1994, Australas. J Comb..

[93]  P. Östergård,et al.  Upper Bounds for Covering Designs by Simulated Annealing , 1993 .

[94]  Marc-Michel Gysin,et al.  Algorithms for searching for normal and near- Yang sequences , 1993 .

[95]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[96]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .