---

Gerzson Kéri (Budapest, Hungary) senior researcher
keri@sztaki.hu
http://www.sztaki.hu/~keri

---

Computer and Automation Research Institute of the Hungarian Academy of Sciences
Laboratory on Engineering & Management Intelligence
Research Group of Operations Research and Decision Systems

^{English version Hungarian version}

• The following two papers were presented at the 19th International Symposium on Mathematical Theory of Networks and Systems, Budapest, Hungary, 5-9 July 2010:
  
  
  
  • Classification Results for Non-Mixed and Mixed Optimal Covering Codes: a Survey Presentation Full paper
  • On the Normality of (Non-Mixed and Mixed) Optimal Covering Codes Presentation Full paper
  
  
• Publications: 1. Most recent papers:
  
  
  • G. Kéri and T. Szántai, Combinatorial results on the fitting problems of the multivariate gamma distribution introduced by Prékopa and Szántai, Annals of Operations Research (Special Volume: Stochastic Modeling and Optimization - Dedicated to the 80th Birthday of Professor András Prékopa), doi: 10.1007/s10479-011-1030-0
    
    
  • G. Kéri, On qualitatively consistent, transitive and contradictory judgment matrices emerging from multiattribute decision procedures, CEJOR (2010), doi: 10.1007/s10100-010-0138-7
    
    
  • C.J. Colbourn, G. Kéri, P.P. Rivas Soriano and J.-C. Schlage-Puchta, Covering and Radius-covering Arrays: Constructions and Classification, Discrete Applied Mathematics 158(2010)1158-1180
    
  
  
• Publications: 2. Earlier papers (selection):
  
  
  
  • On the minimization of the general entropy function on a convex set, Alkalmazott Matematikai Lapok 4(1978)95-108 (in Hungarian). Translation from Hungarian to English.
    
    
  • The Sherman-Morrison formula for the determinant and its application for optimizing quadratic functions on condition sets given by extreme generators, in: Optimization Theory (Mátraháza, 1999)(eds: F. Giannessi, P. Pardalos and T. Rapcsák), Appl. Optim., 59, Kluwer Acad. Publ., Dordrecht, 2001, 119-138. Long version with computational results.
    
    
  • The Number of Inequivalent (2R+3,7)R Optimal Covering Codes [Postsript] [PDF], G. Kéri and P. R. J. Östergård, J. Integer Seq. 9(2006) 06.4.7.
  
  
• Publications: 3. Web tables:
  
  
  
  • Tables for bounds on covering codes - Last modified: 2011.11.21.
    
    
  • Tables for n-arcs and lists for complete n-arcs in PG(r,q) - Last modified: 2009.12.08.
    
    • A downloadable computer program for generating n-arcs
    
    
  • Tables for sums of powers and some other tables of elementary mathematics
  
  
• Link to the list of my all publications
  
  
• Link to the bibliography of publications related to covering radius, prepared and maintained by A. Lobstein