Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics
From MaRDI portal
Publication:315502
DOI10.1007/S11590-015-0927-YzbMath1353.90132OpenAlexW1100220100MaRDI QIDQ315502
K. E. Parsopoulos, Dimitris Souravlias, Ilias S. Kotsireas
Publication date: 21 September 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0927-y
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Circulant weighing matrices
- Periodic complementary binary sequences and combinatorial optimization algorithms
- Study of proper circulant weighing matrices with weight 9
- Heuristic algorithms for Hadamard matrices with two circulant cores
- Attraction probabilities in variable neighborhood search
- Determination of all possible orders of weight 16 circulant weighing matrices
- Weighing matrices and their applications
- Variable neighborhood search
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- Circulant weighing matrices whose order and weight are products of powers of 2 and 3
- Future paths for integer programming and links to artificial intelligence
- Quantum algorithms for weighing matrices and quadratic residues
- The solution of the Waterloo problem
- Competent genetic algorithms for weighing matrices
- Parameter selection and adaptation in Unified Particle Swarm Optimization
- Parallel Algorithm Portfolio with Market Trading-Based Time Allocation
- Smallest Position Value Approach
- Some results on weighing matrices
- Self-dual codes over F/sub p/ and weighing matrices
- Parallel Metaheuristics
This page was built for publication: Circulant weighing matrices: a demanding challenge for parallel optimization metaheuristics
