Pastāsti draugiem par šo preci:
Generating Solutions to the N-queens Problem: Using 2-circulant Matrices, Maximal Cliques and 0-1 Integer Programming Kristine Joy Carpio
Generating Solutions to the N-queens Problem: Using 2-circulant Matrices, Maximal Cliques and 0-1 Integer Programming
Kristine Joy Carpio
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.
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2011. gada 17. marts |
| ISBN13 | 9783844309232 |
| Izdevēji | LAP LAMBERT Academic Publishing |
| Lapas | 60 |
| Izmēri | 226 × 4 × 150 mm · 107 g |
| Valoda | Vācu |