/* See English below */
/*********************************************************************/
/* MBMUDs.c, Generador de MBMUDs a base de fixar el nombre d'uns per fila
   i columna i minimitzar les quadruples amb moviments de tipus 
   (10,01)->(01,10). Busca l'optim o, en el seu defecte, el millor minim
   local despres d'un numero d'iteracions donat. Mes detalls a l'article 
   mencionat a continuacio.
   
   Si us plau, aquest programa es codi lliure, per referenciar-lo citeu:
   Bofill, P. & Torras, C., "MBMUDs: a combinatorial extension of BIBDs
   showing good optimality behaviour", Journal of Statistical Planning
   and Inference 124 (2004) 185-204.

   Per compilar: cc -o MBMUDs -O MBMUDs.c -lm

   Pau, Maig 2002 (pau@ac.upc.es)    
   Ultima revisio, 29 de Juliol 2004 (la versio de l'1 de Juliol tenia
   un error: a cada iteracio no recorria exhaustivament totes les
   quadruples possibles). */
/*********************************************************************/
/* MBMUDs.c, MBMUD generator based on setting the right number of ones
   per row and column, and then minimizing the number of quadruples
   using unit rearrangements of the kind (10,01)->(01,10). Searches
   the optimal configuration or, in case of failure, the best local 
   minimum within a given number of iterations. See the reference below 
   for details.
   
   This program is free code. Please, use the following reference for
   citation:
   Bofill, P. & Torras, C., "MBMUDs: a combinatorial extension of BIBDs
   showing good optimality behaviour", Journal of Statistical Planning
   and Inference 124 (2004) 185-204.

   Compile with: cc -o MBMUDs -O MBMUDs.c -lm

   Pau, May 2002 (pau@ac.upc.es)  
   Last revision, July 29th 2004 (The version of July 1st had a bug:
   Not all possible quadruples were tested at every iteration). */
/*********************************************************************/