889:-
Uppskattad leveranstid 7-11 arbetsdagar
Fri frakt för medlemmar vid köp för minst 249:-
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.
- Format: Pocket/Paperback
- ISBN: 9783844309232
- Språk: Engelska
- Antal sidor: 60
- Utgivningsdatum: 2011-03-17
- Förlag: LAP Lambert Academic Publishing