<?xml version="1.0" encoding="UTF-8"?> <article key="pdf/12078" mdate="2013-06-22 00:00:00"> <author>Kaziyev G. Z. and Nabiyeva G. S. and Kalizhanova A.U.</author> <title>Effective Class of Discreet Programing Problems</title> <pages>971 - 974</pages> <year>2013</year> <volume>7</volume> <number>6</number> <journal>International Journal of Mathematical and Computational Sciences</journal> <ee>https://publications.waset.org/pdf/12078</ee> <url>https://publications.waset.org/vol/78</url> <publisher>World Academy of Science, Engineering and Technology</publisher> <abstract>We consider herein a concise view of discreet programming models and methods. There has been conducted the models and methods analysis. On the basis of discreet programming models there has been elaborated and offered a new class of problems, i.e. blocksymmetry models and methods of applied tasks statements and solutions.</abstract> <index>Open Science Index 78, 2013</index> </article>