Autorenfreundlich Bücher kaufen?!
Beschreibung
This work presents procedures for generating solutions to the n-Queens problem using 2-circulant matrices, maximal cliques of graphs and 0-1 integer programming. Some constructions on matrices to prove that a solution exists for n > 3 are also presented. The use of maximal cliques is an application from the field of graph theory; the use of 0-1 integer programming is an application from the field of operations research.
Using 2-Circulant Matrices, Maximal Cliques and 0-1 Integer Programming
Details
| Verlag | LAP LAMBERT Academic Publishing |
| Ersterscheinung | 17. März 2011 |
| Maße | 22 cm x 15 cm x 0.5 cm |
| Gewicht | 107 Gramm |
| Format | Softcover |
| ISBN-13 | 9783844309232 |
| Seiten | 60 |
Schlagwörter
Bekannt durch
