Skip navigation
Please use this identifier to cite or link to this item:http://essuir.sumdu.edu.ua/handle/123456789/55771
Title: About the Simplex Form of the Polyhedron of Arrangements
Authors: Iemets, O.O.
Yemets`, O.O.
Polyakov, I.M.
Keywords: Euclidean combinatorial optimization
arrangements
simplex form of a polyhedron
polyhedron of arrangements
Евклідова комбінаторна оптимізація
Евклидова комбинаторная оптимизация
симплексна форма багатогранника
симплексная форма многогранника
Issue Year: 2017
Publisher: Sumy State University
Citation: Iemets, O.O. About the Simplex Form of the Polyhedron of Arrangements [Текст] / O.O. Iemets, O.O. Yemets`, I.M. Polyakov // Advanced Information Systems and Technologies : proceedings of the V international scientific conference, Sumy, May 17-19 2017/ Edited by S.І. Protsenko, V.V. Shendryk. - Sumy : Sumy State University, 2017. - P. 18-20.
Abstract: The simplex form of the general polyhedron of arrangements, which is used in linear programming problems in combinatorial cutting methods is obtained and it increases the efficiency of cutting methods.
URI: http://essuir.sumdu.edu.ua/handle/123456789/55771
Type: Theses
Appears in Collections:Наукові видання (ЕлІТ)

Views
Other4
Germany1
EU1
France3
Ukraine3
United States3
Downloads
Germany1


Files in This Item:
File Description SizeFormatDownloads 
Iemets_form.pdf529.34 kBAdobe PDF1Download
Show full item record Recommend this item


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.