An efficient string sorting algorithm for weighing matrices of small weight
DOI10.1007/S11590-009-0144-7zbMATH Open1227.05100OpenAlexW2014643492MaRDI QIDQ845549FDOQ845549
Authors: Ilias S. Kotsireas, Christos Koukouvinos, Panos M. Pardalos 
Publication date: 29 January 2010
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-009-0144-7
Recommendations
Optimal statistical designs (62K05) Combinatorial optimization (90C27) Searching and sorting (68P10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Applications of design theory to circuits and networks (94C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Periodic complementary binary sequences and combinatorial optimization algorithms
- Encyclopedia of optimization. In 6 vols.
- New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function---a review
- New infinite classes of weighing matrices
Cited In (6)
- New weighing matrices constructed from two circulant submatrices
- A modified power spectral density test applied to weighing matrices with small weight
- Weighing matrices and string sorting
- Title not available (Why is that?)
- Competent genetic algorithms for weighing matrices
- Applying computer algebra systems with SAT solvers to the Williamson conjecture
This page was built for publication: An efficient string sorting algorithm for weighing matrices of small weight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845549)
