Search academic texts

Information × Registration Number 0205U000797, 0103U001406 , R & D reports Title The methods of the cutting in Euclidean combinatorial cptimization and a development of it theory popup.stage_title Head Gubreev Gennady Mickailovich, Registration Date 11-02-2005 Organization Polava National Technical University named in the honour of Yuri Kondratyuk popup.description2 The object of investigations: problems of Euclidean combinatorial optimization, methods of their solving, Euclidean combinatorial sets and their properties. The purpose of work: developing existing new properties of combinatorial optimization problems and combinatorial sets; working out new methods and algorithms of Euclidean combinatorial optimization. The method of investigations: Euclidean combinatorial optimization methods, mathematical modeling, mathematical programming and methods of polyhedral combinatorics. The main results of the scientific work: the cutting method in Euclidean combinatorial optimization was developed and improved. The new properties, in particular optimization properties, of combinatorial set of permutation, polypermutation and arrangement were founded. The new methods and algorithms of linear and nonlinear, parametrical and unparametrical optimization on combinatorial sets with restrictions and without restrictions were done. The results were introduced at the Poltava national technical university into different theoretical courses such as "Optimization methods", "The elements of combinatorial optimization" and lectures, practical classes and term papers. Key words: combinatorial optimization, cutting methods, permutations, arrangements, combinations, parametrical optimization, unreduced system of constraints. Product Description popup.authors popup.nrat_date 2020-04-02 Close