Please use this identifier to cite or link to this item:
http://cris.utm.md/handle/5014/4332
DC Field | Value | Language |
---|---|---|
dc.contributor.author | MORARU, V. | |
dc.date.accessioned | 2019-09-03T10:32:29Z | |
dc.date.accessioned | 2019-10-02T12:30:44Z | - |
dc.date.available | 2019-09-03T10:32:29Z | |
dc.date.available | 2019-10-02T12:30:44Z | - |
dc.date.issued | 2001 | |
dc.identifier.citation | MORARU, V. Calculul gradientului funcţiei de penalizare în problema max-cut. In: Meridian Ingineresc. 2001, nr. 2, pp. 27-30. ISSN 1683-853X. | en_US |
dc.identifier.issn | 1683-853X | |
dc.identifier.uri | http://repository.utm.md/handle/5014/4332 | |
dc.identifier.uri | http://cris.utm.md/handle/5014/4332 | - |
dc.description.abstract | Prezenta lucrare este consacrată problemei determinării tăieturii maxime într-un graf. Pentru rezolvarea problemei relaxate max-cut se utilizează metoda punctului interior. Se prezintă o procedură efectivă de calcul al gradientului funcţiei de barieră, evitând inversarea matricelor. | en_US |
dc.description.abstract | The present work is devoted to the problem of determinating the maximum cut in a graph. For solving the relaxation max-cut problem the method of interior point is used. In the work there is presented an efficient procedure of computation of the gradient of the barrier function, not demanding matrix inversion. | en |
dc.description.abstract | Cet ouvrage est consacré au problème de détermination de la coupe maximale dans un graphe. Pour la résolution du problème relaxé max-cut on utilise la méthode du point intérieur. On présente une procédure effective de calcul du gradient de la fonction de barrière, en évitant l‘inversion des matrices. | fr |
dc.description.abstract | Настоящая работа посвящена задачи определения максимального сечения в графе. Для решения ослабленной max-cut задаче используется метод внутренней точки. В работе приводится эффективный способ вычисления градиента барьерной функции, не требующий обращения матриц. | ru |
dc.language.iso | ro | en_US |
dc.publisher | Tehnica-Info | en_US |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
dc.subject | max-cut problem | en_US |
dc.subject | graphs | en_US |
dc.subject | grafuri | en_US |
dc.subject | problema max-cut | en_US |
dc.title | Calculul gradientului funcţiei de penalizare în problema max-cut | en_US |
dc.title.alternative | The computation of the gradient of penalty function in max-cut problem | en_US |
dc.title.alternative | Le calcul du gradient de la fonction de pénalisation dans le problème max-cut | en_US |
dc.title.alternative | Вычисление градиента штрафной функции в max-cut задаче | en_US |
dc.type | Article | en_US |
item.languageiso639-1 | other | - |
item.grantfulltext | open | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | 2001 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
MI_2001_2_pg_27_30.pdf | 618.36 kB | Adobe PDF | View/Open |
Google ScholarTM
Check
This item is licensed under a Creative Commons License