<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://m2.mtmt.hu/xsl/gui3.xsl" ?>
<myciteResult>
  <serverUrl>https://m2.mtmt.hu/</serverUrl>
  <labelLang>hun</labelLang>
  <responseDate>2026-04-30 11:56</responseDate>
  <content>
    <publication>
      <otype>JournalArticle</otype>
      <mtid>3323588</mtid>
      <status>VALIDATED</status>
      <published>true</published>
      <unhandledTickets>0</unhandledTickets>
      <oldTimestamp>2018-07-27T22:20:07.000+0000</oldTimestamp>
      <deleted>false</deleted>
      <oldId>3323588</oldId>
      <lastRefresh>2026-04-14T13:16:33.952+0000</lastRefresh>
      <lastModified>2020-12-22T20:31:36.236+0000</lastModified>
      <created>2018-01-25T14:36:12.000+0000</created>
      <creator>
        <snippet>true</snippet>
        <mtid>10010616</mtid>
        <familyName>Fábián</familyName>
        <givenName>Csaba</givenName>
        <link>/api/author/10010616</link>
        <otype>Author</otype>
        <label>Fábián Csaba (Matematikai és számítástudományok)</label>
        <published>true</published>
        <oldId>10010616</oldId>
      </creator>
      <lastDuplumOK>2021-09-19T07:22:56.748+0000</lastDuplumOK>
      <lastDuplumSearch>2021-09-19T07:22:56.748+0000</lastDuplumSearch>
      <adminApproved>2019-02-01T10:01:23.424+0000</adminApproved>
      <adminApprover>
        <snippet>true</snippet>
        <mtid>10039288</mtid>
        <familyName>Szmolyán</familyName>
        <givenName>Mária</givenName>
        <link>/api/admin/10039288</link>
        <otype>Admin</otype>
        <label>Szmolyán Mária (BME 4 admin - INAKTÍV)</label>
        <published>true</published>
        <oldId>10039288</oldId>
      </adminApprover>
      <validated>2019-03-08T02:11:24.766+0000</validated>
      <validator>
        <snippet>true</snippet>
        <mtid>565</mtid>
        <familyName>WoS</familyName>
        <givenName>import</givenName>
        <link>/api/admin/565</link>
        <otype>Admin</otype>
        <label>WoS import (admin)</label>
        <published>true</published>
      </validator>
      <tempLockers>
        <otype>Admin</otype>
        <mtid>10025544</mtid>
        <link>/api/admin/10025544</link>
        <label>Lévayné Deseő Katalin (MTMT Központi admin)</label>
        <familyName>Lévayné Deseő</familyName>
        <givenName>Katalin</givenName>
        <published>true</published>
        <oldId>10025544</oldId>
        <snippet>true</snippet>
      </tempLockers>
      <tempLocked>2019-03-28T15:11:29.374+0000</tempLocked>
      <core>true</core>
      <publicationPending>false</publicationPending>
      <type>
        <snippet>true</snippet>
        <mtid>24</mtid>
        <code>24</code>
        <link>/api/publicationtype/24</link>
        <otype>PublicationType</otype>
        <label>Folyóiratcikk</label>
        <listPosition>1</listPosition>
        <published>true</published>
        <oldId>24</oldId>
        <otypeName>JournalArticle</otypeName>
      </type>
      <subType>
        <snippet>true</snippet>
        <mtid>10000059</mtid>
        <nameEng>Article</nameEng>
        <docType>
          <snippet>true</snippet>
          <mtid>24</mtid>
          <code>24</code>
          <link>/api/publicationtype/24</link>
          <otype>PublicationType</otype>
          <label>Folyóiratcikk</label>
          <listPosition>1</listPosition>
          <published>true</published>
          <oldId>24</oldId>
          <otypeName>JournalArticle</otypeName>
        </docType>
        <link>/api/subtype/10000059</link>
        <name>Szakcikk</name>
        <otype>SubType</otype>
        <label>Szakcikk (Folyóiratcikk)</label>
        <listPosition>101</listPosition>
        <published>true</published>
        <oldId>10000059</oldId>
      </subType>
      <category>
        <snippet>true</snippet>
        <mtid>1</mtid>
        <link>/api/category/1</link>
        <otype>Category</otype>
        <label>Tudományos</label>
        <published>true</published>
        <oldId>1</oldId>
      </category>
      <firstAuthor>Csaba, I Fábián</firstAuthor>
      <title>Probability maximization by inner approximation</title>
      <journal>
        <snippet>true</snippet>
        <sciIndexed>true</sciIndexed>
        <link>/api/journal/2149438</link>
        <reviewType>REVIEWED</reviewType>
        <label>ACTA POLYTECHNICA HUNGARICA 1785-8860 1785-8860</label>
        <published>true</published>
        <hungarian>true</hungarian>
        <oldId>2149438</oldId>
        <noIF>false</noIF>
        <mtid>2149438</mtid>
        <scopusIndexed>true</scopusIndexed>
        <pIssn>1785-8860</pIssn>
        <eIssn>1785-8860</eIssn>
        <otype>Journal</otype>
        <lang>FOREIGN</lang>
      </journal>
      <volume>15</volume>
      <issue>1</issue>
      <firstPage>105</firstPage>
      <lastPage>125</lastPage>
      <firstPageOrInternalIdForSort>105</firstPageOrInternalIdForSort>
      <pageLength>21</pageLength>
      <publishedYear>2018</publishedYear>
      <abstractText>We solve probability maximization problems using an approximation scheme that is analogous to the classic approach of p-efficient points, proposed by Prékopa to handle chance constraints. But while p-efficient points yield an approximation of a level set of the probabilistic function, we approximate the epigraph. The present scheme is easy to implement and is immune to noise in gradient computation. © 2018, Budapest Tech Polytechnical Institution. All rights reserved.</abstractText>
      <digital/>
      <printed/>
      <sourceYear>2018</sourceYear>
      <foreignEdition>false</foreignEdition>
      <foreignLanguage>true</foreignLanguage>
      <fullPublication>true</fullPublication>
      <conferencePublication>false</conferencePublication>
      <nationalOrigin>true</nationalOrigin>
      <missingAuthor>false</missingAuthor>
      <oaType>GOLD</oaType>
      <oaCheckDate>2026-04-14</oaCheckDate>
      <oaFree>true</oaFree>
      <oaLink>https://doi.org/10.12700/APH.15.1.2018.1.7</oaLink>
      <citationCount>12</citationCount>
      <citationCountUnpublished>0</citationCountUnpublished>
      <citationCountWoOther>11</citationCountWoOther>
      <independentCitCountWoOther>5</independentCitCountWoOther>
      <nationalOriginCitationCount>4</nationalOriginCitationCount>
      <foreignEditionCitationCount>10</foreignEditionCitationCount>
      <doiCitationCount>9</doiCitationCount>
      <wosCitationCount>8</wosCitationCount>
      <scopusCitationCount>6</scopusCitationCount>
      <wosScopusCitationCount>8</wosScopusCitationCount>
      <wosScopusCitationCountWoOther>8</wosScopusCitationCountWoOther>
      <wosScopusIndependentCitationCount>3</wosScopusIndependentCitationCount>
      <wosScopusIndependentCitationCountWoOther>3</wosScopusIndependentCitationCountWoOther>
      <independentCitationCount>6</independentCitationCount>
      <selfCitationCount>6</selfCitationCount>
      <unhandledCitationCount>0</unhandledCitationCount>
      <citingPubCount>12</citingPubCount>
      <independentCitingPubCount>6</independentCitingPubCount>
      <citingPubCountWoOther>11</citingPubCountWoOther>
      <independentCitingPubCountWoOther>5</independentCitingPubCountWoOther>
      <unhandledCitingPubCount>0</unhandledCitingPubCount>
      <citedPubCount>11</citedPubCount>
      <citedCount>11</citedCount>
      <pubStats>
        <types>
          <type>Folyóiratcikk</type>
          <typeEng>Journal Article</typeEng>
          <code>24</code>
          <count>8</count>
        </types>
        <types>
          <type>Könyvrészlet</type>
          <typeEng>Chapter in Book</typeEng>
          <code>25</code>
          <count>3</count>
        </types>
        <types>
          <type>Könyv</type>
          <typeEng>Book</typeEng>
          <code>23</code>
          <count>0</count>
        </types>
        <types>
          <type>Egyéb konferenciaközlemény</type>
          <typeEng>Conference paper</typeEng>
          <code>31</code>
          <count>0</count>
        </types>
        <types>
          <type>Egyéb konferenciakötet</type>
          <typeEng>Conference proceedings</typeEng>
          <code>32</code>
          <count>0</count>
        </types>
        <types>
          <type>Oltalmi formák</type>
          <typeEng>Protection forms</typeEng>
          <code>26</code>
          <count>0</count>
        </types>
        <types>
          <type>Disszertáció</type>
          <typeEng>Thesis</typeEng>
          <code>28</code>
          <count>1</count>
        </types>
        <types>
          <type>Egyéb</type>
          <typeEng>Miscellaneous</typeEng>
          <code>29</code>
          <count>0</count>
        </types>
        <types>
          <type>Alkotás</type>
          <typeEng>Achievement</typeEng>
          <code>22</code>
          <count>0</count>
        </types>
        <types>
          <type>Kutatási adat</type>
          <typeEng>Research data</typeEng>
          <code>33</code>
          <count>0</count>
        </types>
        <citationTypes>
          <type>Folyóiratcikk</type>
          <typeEng>Journal Article</typeEng>
          <code>24</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Könyvrészlet</type>
          <typeEng>Chapter in Book</typeEng>
          <code>25</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Könyv</type>
          <typeEng>Book</typeEng>
          <code>23</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Egyéb konferenciaközlemény</type>
          <typeEng>Conference paper</typeEng>
          <code>31</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Egyéb konferenciakötet</type>
          <typeEng>Conference proceedings</typeEng>
          <code>32</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Oltalmi formák</type>
          <typeEng>Protection forms</typeEng>
          <code>26</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Disszertáció</type>
          <typeEng>Thesis</typeEng>
          <code>28</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Egyéb</type>
          <typeEng>Miscellaneous</typeEng>
          <code>29</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Alkotás</type>
          <typeEng>Achievement</typeEng>
          <code>22</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <citationTypes>
          <type>Kutatási adat</type>
          <typeEng>Research data</typeEng>
          <code>33</code>
          <countUnknown>0</countUnknown>
          <countIndependent>0</countIndependent>
          <countSelfCitation>0</countSelfCitation>
        </citationTypes>
        <years>
          <year>2019</year>
          <publicationCount>0</publicationCount>
          <citationCount>2</citationCount>
          <independentCitationCount>2</independentCitationCount>
          <citingPubCount>2</citingPubCount>
          <independentCitingPubCount>2</independentCitingPubCount>
          <oaStats/>
          <oaStats2/>
        </years>
        <years>
          <year>2020</year>
          <publicationCount>0</publicationCount>
          <citationCount>1</citationCount>
          <independentCitationCount>0</independentCitationCount>
          <citingPubCount>1</citingPubCount>
          <independentCitingPubCount>0</independentCitingPubCount>
          <oaStats/>
          <oaStats2/>
        </years>
        <years>
          <year>2021</year>
          <publicationCount>0</publicationCount>
          <citationCount>2</citationCount>
          <independentCitationCount>0</independentCitationCount>
          <citingPubCount>2</citingPubCount>
          <independentCitingPubCount>0</independentCitingPubCount>
          <oaStats/>
          <oaStats2/>
        </years>
        <years>
          <year>2022</year>
          <publicationCount>0</publicationCount>
          <citationCount>4</citationCount>
          <independentCitationCount>3</independentCitationCount>
          <citingPubCount>4</citingPubCount>
          <independentCitingPubCount>3</independentCitingPubCount>
          <oaStats/>
          <oaStats2/>
        </years>
        <years>
          <year>2023</year>
          <publicationCount>0</publicationCount>
          <citationCount>1</citationCount>
          <independentCitationCount>1</independentCitationCount>
          <citingPubCount>1</citingPubCount>
          <independentCitingPubCount>1</independentCitingPubCount>
          <oaStats/>
          <oaStats2/>
        </years>
        <years>
          <year>2024</year>
          <publicationCount>0</publicationCount>
          <citationCount>0</citationCount>
          <independentCitationCount>0</independentCitationCount>
          <citingPubCount>0</citingPubCount>
          <independentCitingPubCount>0</independentCitingPubCount>
          <oaStats/>
          <oaStats2/>
        </years>
        <years>
          <year>2025</year>
          <publicationCount>0</publicationCount>
          <citationCount>2</citationCount>
          <independentCitationCount>0</independentCitationCount>
          <citingPubCount>2</citingPubCount>
          <independentCitingPubCount>0</independentCitingPubCount>
          <oaStats/>
          <oaStats2/>
        </years>
      </pubStats>
      <ratingsForSort>Q2</ratingsForSort>
      <mtaRatingsForSort>A</mtaRatingsForSort>
      <hasCitationDuplums>false</hasCitationDuplums>
      <inSelectedPubs>10049404</inSelectedPubs>
      <importDuplum>false</importDuplum>
      <importOverwritten>false</importOverwritten>
      <importSkipped>false</importSkipped>
      <userChangeableUntil>2018-01-26T10:17:12.000+0000</userChangeableUntil>
      <publishDate>2018-01-25T14:38:42.000+0000</publishDate>
      <directInstitutesForSort>Differenciálegyenletek Tanszék (BME / TTK / MI); Informatika Tanszék (NJE / GAMFK)</directInstitutesForSort>
      <ownerAuthorCount>6</ownerAuthorCount>
      <ownerInstituteCount>33</ownerInstituteCount>
      <directInstituteCount>2</directInstituteCount>
      <authorCount>7</authorCount>
      <contributorCount>0</contributorCount>
      <hasQualityFactor>true</hasQualityFactor>
      <tempLockerIds>10025544</tempLockerIds>
      <languages>
        <language>
          <otype>Language</otype>
          <mtid>10002</mtid>
          <link>/api/language/10002</link>
          <label>Angol</label>
          <name>Angol</name>
          <nameEng>English</nameEng>
          <published>true</published>
          <oldId>2</oldId>
          <snippet>true</snippet>
        </language>
      </languages>
      <authorships>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>9757611</mtid>
          <link>/api/authorship/9757611</link>
          <label>Csaba, I Fábián [Fábián, Csaba (Matematikai és sz...), szerző] Informatika Tanszék (NJE / GAMFK)</label>
          <listPosition>1</listPosition>
          <share>0.14285715</share>
          <first>true</first>
          <last>false</last>
          <author>
            <otype>Author</otype>
            <mtid>10010616</mtid>
            <link>/api/author/10010616</link>
            <label>Fábián Csaba (Matematikai és számítástudományok)</label>
            <familyName>Fábián</familyName>
            <givenName>Csaba</givenName>
            <published>true</published>
            <oldId>10010616</oldId>
            <snippet>true</snippet>
          </author>
          <familyName>Csaba</familyName>
          <givenName>I Fábián</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <oldId>27520982</oldId>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>9757612</mtid>
          <link>/api/authorship/9757612</link>
          <label>Edit, Csizmás [Gurka Dezsőné Csizmás, Edit Margit (Informatika), szerző] Informatika Tanszék (NJE / GAMFK)</label>
          <listPosition>2</listPosition>
          <share>0.14285715</share>
          <first>false</first>
          <last>false</last>
          <author>
            <otype>Author</otype>
            <mtid>10049404</mtid>
            <link>/api/author/10049404</link>
            <label>Gurka Dezsőné Csizmás Edit Margit (Informatika)</label>
            <familyName>Gurka Dezsőné Csizmás</familyName>
            <givenName>Edit Margit</givenName>
            <published>true</published>
            <oldId>10049404</oldId>
            <snippet>true</snippet>
          </author>
          <familyName>Edit</familyName>
          <givenName>Csizmás</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <oldId>27520981</oldId>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>9757613</mtid>
          <link>/api/authorship/9757613</link>
          <label>Rajmund, Drenyovszki [Drenyovszki, Rajmund (Informatikai Tudo...), szerző] Informatika Tanszék (NJE / GAMFK)</label>
          <listPosition>3</listPosition>
          <share>0.14285715</share>
          <first>false</first>
          <last>false</last>
          <author>
            <otype>Author</otype>
            <mtid>10037855</mtid>
            <link>/api/author/10037855</link>
            <label>Drenyovszki Rajmund (Informatikai Tudományok)</label>
            <familyName>Drenyovszki</familyName>
            <givenName>Rajmund</givenName>
            <published>true</published>
            <oldId>10037855</oldId>
            <snippet>true</snippet>
          </author>
          <familyName>Rajmund</familyName>
          <givenName>Drenyovszki</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <oldId>27520980</oldId>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>9757614</mtid>
          <link>/api/authorship/9757614</link>
          <label>Wim, van Ackooij</label>
          <listPosition>4</listPosition>
          <share>0.14285715</share>
          <first>false</first>
          <last>false</last>
          <familyName>Wim</familyName>
          <givenName>van Ackooij</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <oldId>27520979</oldId>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>9757615</mtid>
          <link>/api/authorship/9757615</link>
          <label>Tibor, Vajnai [Vajnai, Tibor (Elektronspektrosz...), szerző] Informatika Tanszék (NJE / GAMFK)</label>
          <listPosition>5</listPosition>
          <share>0.14285715</share>
          <first>false</first>
          <last>false</last>
          <author>
            <otype>Author</otype>
            <mtid>10013249</mtid>
            <link>/api/author/10013249</link>
            <label>Vajnai Tibor (Elektronspektroszkópia)</label>
            <familyName>Vajnai</familyName>
            <givenName>Tibor</givenName>
            <published>true</published>
            <oldId>10013249</oldId>
            <snippet>true</snippet>
          </author>
          <familyName>Tibor</familyName>
          <givenName>Vajnai</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <oldId>27520978</oldId>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>9757616</mtid>
          <link>/api/authorship/9757616</link>
          <label>Lóránt, Kovács [Kovács, Lóránt (Hálózatmenedzsment), szerző] Informatika Tanszék (NJE / GAMFK)</label>
          <listPosition>6</listPosition>
          <share>0.14285715</share>
          <first>false</first>
          <last>false</last>
          <author>
            <otype>Author</otype>
            <mtid>10003406</mtid>
            <link>/api/author/10003406</link>
            <label>Kovács Lóránt (Hálózatmenedzsment)</label>
            <familyName>Kovács</familyName>
            <givenName>Lóránt</givenName>
            <published>true</published>
            <oldId>10003406</oldId>
            <snippet>true</snippet>
          </author>
          <familyName>Lóránt</familyName>
          <givenName>Kovács</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <oldId>27520977</oldId>
          <snippet>true</snippet>
        </authorship>
        <authorship>
          <otype>PersonAuthorship</otype>
          <mtid>9757617</mtid>
          <link>/api/authorship/9757617</link>
          <label>Tamás, Szántai [Szántai, Tamás (Operációkutatás), szerző] Differenciálegyenletek Tanszék (BME / TTK / MI)</label>
          <listPosition>7</listPosition>
          <share>0.14285715</share>
          <first>false</first>
          <last>true</last>
          <author>
            <otype>Author</otype>
            <mtid>10001251</mtid>
            <link>/api/author/10001251</link>
            <label>Szántai Tamás (Operációkutatás)</label>
            <familyName>Szántai</familyName>
            <givenName>Tamás</givenName>
            <published>true</published>
            <oldId>10001251</oldId>
            <snippet>true</snippet>
          </author>
          <familyName>Tamás</familyName>
          <givenName>Szántai</givenName>
          <authorTyped>true</authorTyped>
          <editorTyped>false</editorTyped>
          <otherTyped>false</otherTyped>
          <type>
            <otype>AuthorshipType</otype>
            <mtid>1</mtid>
            <link>/api/authorshiptype/1</link>
            <label>Szerző</label>
            <code>0</code>
            <published>true</published>
            <oldId>0</oldId>
            <snippet>true</snippet>
          </type>
          <published>false</published>
          <oldId>27520976</oldId>
          <snippet>true</snippet>
        </authorship>
      </authorships>
      <identifiers>
        <identifier>
          <otype>PublicationIdentifier</otype>
          <mtid>1266449</mtid>
          <link>/api/publicationidentifier/1266449</link>
          <label>DOI: 10.12700/APH.15.1.2018.1.7</label>
          <source>
            <otype>PlainSource</otype>
            <mtid>6</mtid>
            <link>/api/publicationsource/6</link>
            <label>DOI</label>
            <type>
              <otype>PublicationSourceType</otype>
              <mtid>10001</mtid>
              <link>/api/publicationsourcetype/10001</link>
              <label>DOI</label>
              <mayHaveOa>true</mayHaveOa>
              <published>true</published>
              <snippet>true</snippet>
            </type>
            <name>DOI</name>
            <nameEng>DOI</nameEng>
            <linkPattern>https://doi.org/@@@</linkPattern>
            <publiclyVisible>true</publiclyVisible>
            <published>true</published>
            <oldId>6</oldId>
            <snippet>true</snippet>
          </source>
          <oaType>GOLD</oaType>
          <oaFree>true</oaFree>
          <validState>IDENTICAL</validState>
          <idValue>10.12700/APH.15.1.2018.1.7</idValue>
          <realUrl>https://doi.org/10.12700/APH.15.1.2018.1.7</realUrl>
          <published>false</published>
          <oldId>1807656</oldId>
          <snippet>true</snippet>
        </identifier>
        <identifier>
          <otype>PublicationIdentifier</otype>
          <mtid>1266447</mtid>
          <link>/api/publicationidentifier/1266447</link>
          <label>WoS: 000422898300007</label>
          <source>
            <otype>PlainSource</otype>
            <mtid>1</mtid>
            <link>/api/publicationsource/1</link>
            <label>WoS</label>
            <type>
              <otype>PublicationSourceType</otype>
              <mtid>10003</mtid>
              <link>/api/publicationsourcetype/10003</link>
              <label>Indexelő adatbázis</label>
              <mayHaveOa>false</mayHaveOa>
              <published>true</published>
              <snippet>true</snippet>
            </type>
            <name>WoS</name>
            <nameEng>WoS</nameEng>
            <linkPattern>https://www.webofscience.com/wos/woscc/full-record/@@@</linkPattern>
            <publiclyVisible>true</publiclyVisible>
            <published>true</published>
            <oldId>1</oldId>
            <snippet>true</snippet>
          </source>
          <oaFree>false</oaFree>
          <validState>IDENTICAL</validState>
          <idValue>000422898300007</idValue>
          <realUrl>https://www.webofscience.com/wos/woscc/full-record/000422898300007</realUrl>
          <published>false</published>
          <oldId>1712077</oldId>
          <snippet>true</snippet>
        </identifier>
        <identifier>
          <otype>PublicationIdentifier</otype>
          <mtid>1266448</mtid>
          <link>/api/publicationidentifier/1266448</link>
          <label>Scopus: 85045186431</label>
          <source>
            <otype>PlainSource</otype>
            <mtid>3</mtid>
            <link>/api/publicationsource/3</link>
            <label>Scopus</label>
            <type>
              <otype>PublicationSourceType</otype>
              <mtid>10003</mtid>
              <link>/api/publicationsourcetype/10003</link>
              <label>Indexelő adatbázis</label>
              <mayHaveOa>false</mayHaveOa>
              <published>true</published>
              <snippet>true</snippet>
            </type>
            <name>Scopus</name>
            <nameEng>Scopus</nameEng>
            <linkPattern>http://www.scopus.com/record/display.url?origin=inward&amp;eid=2-s2.0-@@@</linkPattern>
            <publiclyVisible>true</publiclyVisible>
            <published>true</published>
            <oldId>3</oldId>
            <snippet>true</snippet>
          </source>
          <oaFree>false</oaFree>
          <validState>IDENTICAL</validState>
          <idValue>85045186431</idValue>
          <realUrl>http://www.scopus.com/record/display.url?origin=inward&amp;eid=2-s2.0-85045186431</realUrl>
          <published>false</published>
          <oldId>1807655</oldId>
          <snippet>true</snippet>
        </identifier>
      </identifiers>
      <subjects>
        <classification>
          <otype>Classification</otype>
          <mtid>11082</mtid>
          <link>/api/classification/11082</link>
          <label>Egyéb műszaki tudományok és technológiák</label>
          <published>true</published>
          <snippet>true</snippet>
        </classification>
        <classification>
          <otype>Classification</otype>
          <mtid>10799</mtid>
          <link>/api/classification/10799</link>
          <label>Egyéb természettudományok</label>
          <published>true</published>
          <snippet>true</snippet>
        </classification>
      </subjects>
      <ratings>
        <rating>
          <otype>MtaRating</otype>
          <mtid>11435580</mtid>
          <link>/api/mtarating/11435580</link>
          <label>X. Földtudományok Osztálya:A ACTA POLYTECHNICA HUNGARICA 1785-8860 1785-8860</label>
          <ratingType>
            <otype>RatingType</otype>
            <mtid>10031</mtid>
            <link>/api/ratingtype/10031</link>
            <label>X. Földtudományok Osztálya</label>
            <code>X. FTO</code>
            <institute>
              <otype>Institute</otype>
              <mtid>70</mtid>
              <link>/api/institute/70</link>
              <label>X. Földtudományok Osztálya XFO</label>
              <childrenCount>0</childrenCount>
              <allowInstForum>false</allowInstForum>
              <allowOnlineRegistration>false</allowOnlineRegistration>
              <specialAffiliation>false</specialAffiliation>
              <name>X. Földtudományok Osztálya</name>
              <nameEng>HAS Section of Earth Sciences (X.)</nameEng>
              <published>true</published>
              <oldId>70</oldId>
              <snippet>true</snippet>
            </institute>
            <published>true</published>
            <snippet>true</snippet>
          </ratingType>
          <val>A</val>
          <published>true</published>
          <snippet>true</snippet>
        </rating>
        <rating>
          <otype>SjrRating</otype>
          <mtid>10989144</mtid>
          <link>/api/sjrrating/10989144</link>
          <label>sjr:Q2 (2018) Scopus - Engineering (miscellaneous) ACTA POLYTECHNICA HUNGARICA 1785-8860</label>
          <listPos>192</listPos>
          <rankValue>0.49</rankValue>
          <type>journal</type>
          <ratingType>
            <otype>RatingType</otype>
            <mtid>10002</mtid>
            <link>/api/ratingtype/10002</link>
            <label>sjr</label>
            <code>sjr</code>
            <published>true</published>
            <snippet>true</snippet>
          </ratingType>
          <subject>
            <otype>ClassificationExternal</otype>
            <mtid>2201</mtid>
            <link>/api/classificationexternal/2201</link>
            <label>Scopus - Engineering (miscellaneous)</label>
            <published>true</published>
            <oldId>2201</oldId>
            <snippet>true</snippet>
          </subject>
          <ranking>Q2</ranking>
          <calculation>DIRECT</calculation>
          <published>true</published>
          <snippet>true</snippet>
        </rating>
      </ratings>
      <references>
        <reference>
          <otype>Reference</otype>
          <mtid>2287976</mtid>
          <link>/api/reference/2287976</link>
          <label>1. Arnold, T., Henrion, R., Möller, A., Vigerske, S., A mixed-integer stochastic nonlinear optimization problem with joint probabilistic constraints (2014) Pacific Journal of Optimization, 10, pp. 5-20 </label>
          <listPosition>1</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287977</mtid>
          <link>/api/reference/2287977</link>
          <label>2. Bertocchi, M., Consigli, G., Dempster, M.A.H., (2012) Stochastic Optimization Methods in Finance and Energy: New Financial Products and Energy Market Strategies, , International Series in Operations Research and Management Science. Springer </label>
          <listPosition>2</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287978</mtid>
          <link>/api/reference/2287978</link>
          <label>3. Borell, C., Convex set functions in d-space (1975) Periodica Mathematica Hungarica, 6, pp. 111-136 </label>
          <listPosition>3</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287979</mtid>
          <link>/api/reference/2287979</link>
          <label>4. Brascamp, H.J., Lieb, E.H., On extensions of the Brunn-Minkowski and Prékopa-Leindler theorems, including inequalities for log-concave functions and with an application to the diffusion equations (1976) Journal of Functional Analysis, 22, pp. 366-389 </label>
          <listPosition>4</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287980</mtid>
          <link>/api/reference/2287980</link>
          <label>5. Calafiore, G.C., Campi, M.C., The scenario approach to robust control design (2006) IEEE Trans. Automat. Control, 51, pp. 742-753 </label>
          <listPosition>5</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287981</mtid>
          <link>/api/reference/2287981</link>
          <label>6. Charnes, A., Cooper, W., Deterministic equivalents for optimizing and satisficing under chance constraints (1963) Operations Research, 11, pp. 18-39 </label>
          <listPosition>6</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287982</mtid>
          <link>/api/reference/2287982</link>
          <label>7. Charnes, A., Cooper, W.W., Symonds, G.H., Cost horizons and certainty equivalents: An approach to stochastic programming of heating oil (1958) Management Science, 4, pp. 235-263 </label>
          <listPosition>7</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287983</mtid>
          <link>/api/reference/2287983</link>
          <label>8. Dentcheva, D., Optimization models with probabilistic constraints (2006) Probabilistic and Randomized Methods for Design under Uncertainty, pp. 49-97. , G. Calafiore and F. Dabbene, editors, Springer, 1st edition </label>
          <listPosition>8</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287984</mtid>
          <link>/api/reference/2287984</link>
          <label>9. Dentcheva, D., (2009) Optimisation Models with Probabilistic Constraints. Chapter 4 in [59]. MPS-SIAM Series on Optimization, , SIAM and MPS, Philadelphia </label>
          <listPosition>9</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287985</mtid>
          <link>/api/reference/2287985</link>
          <label>10. Dentcheva, D., Lai, B., Ruszczyński, A., Dual methods for probabilistic optimization problems (2004) Mathematical Methods of Operations Research, 60, pp. 331-346 </label>
          <listPosition>10</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287986</mtid>
          <link>/api/reference/2287986</link>
          <label>11. Dentcheva, D., Martinez, G., Regularization methods for optimization problems with probabilistic constraints (2013) Mathematical Programming, 138, pp. 223-251 </label>
          <listPosition>11</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287987</mtid>
          <link>/api/reference/2287987</link>
          <label>12. Dentcheva, D., Prékopa, A., Ruszczyński, A., Concavity and efficient points of discrete distributions in probabilistic programming (2000) Mathematical Programming, 89, pp. 55-77 </label>
          <listPosition>12</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287988</mtid>
          <link>/api/reference/2287988</link>
          <label>13. Elzinga, J., Moore, T.G., A central cutting plane method for the convex programming problem (1975) Mathematical Programming, 8, pp. 134-145 </label>
          <listPosition>13</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287989</mtid>
          <link>/api/reference/2287989</link>
          <label>14. Ermoliev, Y.M., Ermolieva, T.Y., Macdonald, G.J., Norkin, V.I., Stochastic optimization of insurance portfolios for managing exposure to catastrophic risk (2000) Annals of Operations Research, 99, pp. 207-225 </label>
          <listPosition>14</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287990</mtid>
          <link>/api/reference/2287990</link>
          <label>15. Fábián, C.I., Szántai, T., (2017) A Randomized Method for Smooth Convex Minimization, Motivated by Probability Maximization, , Optimization Online, Posted at the Stochastic Programming area, in March) </label>
          <listPosition>15</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287991</mtid>
          <link>/api/reference/2287991</link>
          <label>16. Floudas, C.A., Pardalos, P.M., (2009) Encyclopedia of Optimization, , Springer - Verlag, 2nd edition </label>
          <listPosition>16</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287992</mtid>
          <link>/api/reference/2287992</link>
          <label>17. Genz, A., Numerical computation of multivariate normal probabilities (1992) J. Comp. Graph Stat., 1, pp. 141-149 </label>
          <listPosition>17</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287993</mtid>
          <link>/api/reference/2287993</link>
          <label>18. Genz, A., Numerical computation of multivariate normal probabilities (1992) Journal of Computational and Graphical Statistics, 1, pp. 141-150 </label>
          <listPosition>18</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287994</mtid>
          <link>/api/reference/2287994</link>
          <label>19. Genz, A., Bretz, F., (2009) Computation of Multivariate Normal and T Probabilities, , Number 195 in Lecture Notes in Statistics. Springer, Dordrecht </label>
          <listPosition>19</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287995</mtid>
          <link>/api/reference/2287995</link>
          <label>20. Henrion, R., (2004) Introduction to Chance Constraint Programming, , www.wias-berlin.de/people/henrion/ccp.ps, Technical report, Weierstrass-Institut für Angewandte Analysis und Stochastik </label>
          <listPosition>20</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287996</mtid>
          <link>/api/reference/2287996</link>
          <label>21. Henrion, R., Möller, A., Optimization of a continuous distillation process under random inflow rate (2003) Computer &amp; Mathematics with Applications, 45, pp. 247-262 </label>
          <listPosition>21</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287997</mtid>
          <link>/api/reference/2287997</link>
          <label>22. Henrion, R., Möller, A., A gradient formula for linear chance constraints under Gaussian distribution (2012) Mathematics of Operations Research, 37, pp. 475-488 </label>
          <listPosition>22</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287998</mtid>
          <link>/api/reference/2287998</link>
          <label>23. Henrion, R., Strugarek, C., Convexity of chance constraints with independent random variables (2008) Computational Optimization and Applications, 41, pp. 263-276 </label>
          <listPosition>23</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2287999</mtid>
          <link>/api/reference/2287999</link>
          <label>24. Henrion, R., Strugarek, C., (2011) Convexity of Chance Constraints with Dependent Random Variables: The Use of Copulae, , (Chapter 17 in [2]). Springer New York </label>
          <listPosition>24</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288000</mtid>
          <link>/api/reference/2288000</link>
          <label>25. Hiriart-Urruty, J.-B., Lemaréchal, C., Convex Analysis and Minimization Algorithms (1993) Springer-Verlag </label>
          <listPosition>25</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288001</mtid>
          <link>/api/reference/2288001</link>
          <label>26. Kall, P., Mayer, J., (2005) Stochastic Linear Programming: Models, Theory, and Computation, , Springer’s International Series in Operations Research and Management Science. Kluwer Academic Publishers </label>
          <listPosition>26</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288002</mtid>
          <link>/api/reference/2288002</link>
          <label>27. Komáromi, È., A dual method for probablistic constrained problems Mathematical Programming Study, , 28:94-112, 1986. (Special issue on stochastic programming, A. Prékopa and R.J.-B. Wets, editors) </label>
          <listPosition>27</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288003</mtid>
          <link>/api/reference/2288003</link>
          <label>28. Komáromi, È., On properties of the probabilistic constrained linear programming problem and its dual (1987) Journal of Optimization Theory and Applications, 55, pp. 377-390 </label>
          <listPosition>28</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288004</mtid>
          <link>/api/reference/2288004</link>
          <label>29. Lejeune, M.A., Pattern-based modeling and solution of probabilistically constrained optimization problems (2012) Operations Research, 60 (6) </label>
          <listPosition>29</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288005</mtid>
          <link>/api/reference/2288005</link>
          <label>30. Lejeune, M.A., Margot, F., Solving chance-constrained optimization problems with stochastic quadratic inequalities (2016) Operations Research, p. 139 </label>
          <listPosition>30</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288006</mtid>
          <link>/api/reference/2288006</link>
          <label>31. Liu, X., Küçükyavuz, S., Luedtke, J., Decomposition algorithms for twostage chance-constrained programs (2016) Mathematical Programming, 157 (1), pp. 219-243 </label>
          <listPosition>31</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288007</mtid>
          <link>/api/reference/2288007</link>
          <label>32. Luedtke, J., Ahmed, S., A sample approximation approach for optimization with probabilistic constraints (2008) SIAM Journal on Optimization, 19, pp. 674-699 </label>
          <listPosition>32</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288008</mtid>
          <link>/api/reference/2288008</link>
          <label>33. Luedtke, J., Ahmed, S., Nemhauser, G.L., An integer programming approach for linear programs with probabilistic constraints (2010) Mathematical Programming, 122 (2), pp. 247-272 </label>
          <listPosition>33</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288009</mtid>
          <link>/api/reference/2288009</link>
          <label>34. Luenberger, D.G., Ye, Y., (2008) Linear and Nonlinear Programming, , International Series in Operations Research and Management Science. Springer </label>
          <listPosition>34</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288010</mtid>
          <link>/api/reference/2288010</link>
          <label>35. Marti, K., Differentiation of probability functions: The transformation method (1995) Computers and Mathematics with Applications, 30, pp. 361-382 </label>
          <listPosition>35</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288011</mtid>
          <link>/api/reference/2288011</link>
          <label>36. Marti, K., Differentiation of probability functions: The transformation method (1996) Math. Programming, 75 (2), pp. 201-220 </label>
          <listPosition>36</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288012</mtid>
          <link>/api/reference/2288012</link>
          <label>37. Mayer, J., (1998) Stochastic Linear Programming Algorithms: A Comparison Based on A Model Management System, , Gordon and Breach Science Publishers </label>
          <listPosition>37</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288013</mtid>
          <link>/api/reference/2288013</link>
          <label>38. Mayer, J., On the Numerical solution of jointly chance constrained problems. Chapter 12 (2000) Kluwer Academic Publishers, , Springer, 1st edition </label>
          <listPosition>38</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288014</mtid>
          <link>/api/reference/2288014</link>
          <label>39. Miller, B.L., Wagner, H.M., Chance constrained programming with joint constraints (1965) Operations Research, 13, pp. 930-945 </label>
          <listPosition>39</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288015</mtid>
          <link>/api/reference/2288015</link>
          <label>40. Minoux, M., (2007) Programmation Mathématique: Théorie Et Algorithmes, , Tec &amp; Doc Lavoisier, 2nd edition </label>
          <listPosition>40</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288016</mtid>
          <link>/api/reference/2288016</link>
          <label>41. Morgan, D.R., Eheart, J.W., Valocchi, A.J., Aquifer remediation design under uncertainty using a new chance constraint programming technique (1993) Water Resources Research, 29, pp. 551-561 </label>
          <listPosition>41</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288017</mtid>
          <link>/api/reference/2288017</link>
          <label>42. Nemirovski, A., Shapiro, A., Convex approximations of chance constrained programs (2006) SIAM Journal of Optimization, 17 (4), pp. 969-996 </label>
          <listPosition>42</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288018</mtid>
          <link>/api/reference/2288018</link>
          <label>43. Pagnoncelli, B., Ahmed, S., Shapiro, A., Sample average approximation method for chance constrained programming: Theory and applications (2009) J. Optim. Theory Appl, 142, pp. 399-416 </label>
          <listPosition>43</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288019</mtid>
          <link>/api/reference/2288019</link>
          <label>44. Prékopa, A., On probabilistic constrained programming (1970) Proceedings of the Princeton Symposium on Mathematical Programming, pp. 113-138. , H.W. Kuhn, editor, Princeton University Press, Princeton, New Jersey </label>
          <listPosition>44</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288020</mtid>
          <link>/api/reference/2288020</link>
          <label>45. Prékopa, A., Logarithmic concave measures with applications to stochastic programming (1971) Acta Scientiarium Mathematicarum (Szeged), 32, pp. 301-316 </label>
          <listPosition>45</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288021</mtid>
          <link>/api/reference/2288021</link>
          <label>46. Prékopa, A., Contributions to the theory of stochastic programming (1973) Mathematical Programming, 4, pp. 202-221 </label>
          <listPosition>46</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288022</mtid>
          <link>/api/reference/2288022</link>
          <label>47. Prékopa, A., On logarithmic concave measures and functions (1973) Acta Scientiarium Mathematicarum (Szeged), 34, pp. 335-343 </label>
          <listPosition>47</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288023</mtid>
          <link>/api/reference/2288023</link>
          <label>48. Prékopa, A., Dual method for a one-stage stochastic programming problem with random rhs obeying a discrete probabiltiy distribution. Z (1990) Operations Research, 34, pp. 441-461 </label>
          <listPosition>48</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288024</mtid>
          <link>/api/reference/2288024</link>
          <label>49. Prékopa, A., (1995) Stochastic Programming, , Kluwer Academic Publishers, Dordrecht </label>
          <listPosition>49</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288025</mtid>
          <link>/api/reference/2288025</link>
          <label>50. Prékopa, A., Probabilistic programming (2003) Stochastic Programming, Volume 10 of Handbooks in Operations Research and Management Science, , Chapter 5, Elsevier, Amsterdam </label>
          <listPosition>50</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288026</mtid>
          <link>/api/reference/2288026</link>
          <label>51. Prékopa, A., (2007) On the Relationship between Probabilistic Constrained, Disjunctive and Multiobjective Programming, , Technical Report 7-2007, Rutgers Center for Operations Research, Rutgers University, Piscataway, NJ, RUTCOR Research Report) </label>
          <listPosition>51</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288027</mtid>
          <link>/api/reference/2288027</link>
          <label>52. Prékopa, A., Ganczer, S., Deák, I., Patyi, K., The STABIL stochastic programming model and its experimental application to the electrical energy sector of the Hungarian economy (1980) Stochastic Programming, pp. 369-385. , M.A.H. Dempster, editor, Academic Press, London </label>
          <listPosition>52</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288028</mtid>
          <link>/api/reference/2288028</link>
          <label>53. Prékopa, A., Szántai, T., Flood control reservoir system design using stochastic programming (1978) Math. Programming Study, 9, pp. 138-151 </label>
          <listPosition>53</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288029</mtid>
          <link>/api/reference/2288029</link>
          <label>54. Prékopa, A., Szántai, T., A new multivariate gamma distribution and its fitting to empirical streamflow data (1978) Water Resources Research, 14, pp. 19-24 </label>
          <listPosition>54</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288030</mtid>
          <link>/api/reference/2288030</link>
          <label>55. Prékopa, A., Szántai, T., On optimal regulation of a storage level with application to the water level regulation of a lake (1979) European Journal of Operations Research, 3, pp. 175-189 </label>
          <listPosition>55</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288031</mtid>
          <link>/api/reference/2288031</link>
          <label>56. Prékopa, A., Vizvári, B., Badics, T., Programming under probabilistic constraint with discrete random variable (1998) New Trends in Mathematical Programming, pp. 235-255. , F. Giannesi, T. Rapcsák, and S. Komlósi, editors, Kluwer, Dordrecht </label>
          <listPosition>56</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288032</mtid>
          <link>/api/reference/2288032</link>
          <label>57. Ruszczyński, A., (2006) Nonlinear Optmization </label>
          <listPosition>57</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288033</mtid>
          <link>/api/reference/2288033</link>
          <label>58. Ruszczyński, A., Shapiro, A., (2003) Stochastic Programming, Volume 10 of Handbooks in Operations Research and Management Science, , Elsevier, Amsterdam </label>
          <listPosition>58</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288034</mtid>
          <link>/api/reference/2288034</link>
          <label>59. Shapiro, A., Dentcheva, D., Ruszczyński, A., Lectures on Stochastic Programming (2009) Modeling and Theory, Volume 9 of MPS-SIAM Series on Optimization, , SIAM and MPS, Philadelphia </label>
          <listPosition>59</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288035</mtid>
          <link>/api/reference/2288035</link>
          <label>60. Szántai, T., (1985) Numerical Evaluation of Probabilities concerning Multidimensional Probability Distributions, , PhD thesis, Hungarian Academy of Sciences </label>
          <listPosition>60</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288036</mtid>
          <link>/api/reference/2288036</link>
          <label>61. Szántai, T., A computer code for solution of probabilistic-constrained stochastic programming problems (1988) Numerical Techniques for Stochastic Optimization, pp. 229-235. , Y.M. Ermoliev and R.J.-B. Wets, editors, Springer-Verlag, Berlin </label>
          <listPosition>61</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288037</mtid>
          <link>/api/reference/2288037</link>
          <label>62. Szántai, T., Probabilistic constrained programming and distributions with given marginals (1997) Distributions with Given Marginals and Moment Problems, pp. 205-210. , J. Stepan V. Benes, editor </label>
          <listPosition>62</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288038</mtid>
          <link>/api/reference/2288038</link>
          <label>63. Tamm, E., On g-concave functions and probability measures (Russian). Eesti NSV Teaduste Akademia Toimetised (1977) Füüsika-Matemaatika, 28, pp. 17-24 </label>
          <listPosition>63</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288039</mtid>
          <link>/api/reference/2288039</link>
          <label>64. Topkis, D.M., Veinott, A.F., On the convergence of some feasible direction algorithms for nonlinear programming (1967) SIAM Journal on Control, 5 (2), pp. 268-279 </label>
          <listPosition>64</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288040</mtid>
          <link>/api/reference/2288040</link>
          <label>65. Uryas’Ev, S., Derivatives of probability functions and integrals over sets given by inequalities (1994) Journal of Computational and Applied Mathematics, 56 (1-2), pp. 197-223 </label>
          <listPosition>65</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288041</mtid>
          <link>/api/reference/2288041</link>
          <label>66. Uryas’Ev, S., Derivatives of probability functions and some applications (1995) Annals of Operations Research, 56, pp. 287-311 </label>
          <listPosition>66</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288042</mtid>
          <link>/api/reference/2288042</link>
          <label>67. Uryas’Ev, S., Derivatives of probability and Integral functions: General Theory and Examples. Appearing (2009) Encyclopedia of Optimization, , Springer - Verlag, 2nd edition </label>
          <listPosition>67</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288043</mtid>
          <link>/api/reference/2288043</link>
          <label>68. Uryas’Ev, S., Probabilistic Constrained Optimization: Methodology and Applications (2000) Kluwer Academic Publishers </label>
          <listPosition>68</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288044</mtid>
          <link>/api/reference/2288044</link>
          <label>69. Van Ackooij, W., Decomposition approaches for block-structured chanceconstrained programs with application to hydro-thermal unit commitment (2014) Mathematical Methods of Operations Research, 80 </label>
          <listPosition>69</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288045</mtid>
          <link>/api/reference/2288045</link>
          <label>70. Van Ackooij, W., Eventual convexity of chance constrained feasible sets. Optimization (A (2015) Journal of Math. Programming and Operations Research), 64, pp. 1263-1284 </label>
          <listPosition>70</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288046</mtid>
          <link>/api/reference/2288046</link>
          <label>71. Van Ackooij, W., Berge, V., De Oliveira, W., Sagastizábal, C., Probabilistic optimization via approximate p-efficient points and bundle methods (2017) Computers &amp; Operations Research, 77, pp. 177-193 </label>
          <listPosition>71</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288047</mtid>
          <link>/api/reference/2288047</link>
          <label>72. Van Ackooij, W., De Oliveira, W., Level bundle methods for constrained convex optimization with various oracles (2014) Computation Optimization and Applications, 57 (3), pp. 555-597 </label>
          <listPosition>72</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288048</mtid>
          <link>/api/reference/2288048</link>
          <label>73. Van Ackooij, W., Henrion, R., (Sub-)gradient formulae for probability functions of random inequality systems under gaussian distribution (2017) SIAM/ASA Journal on Uncertainty Quantification, 5 (1), pp. 63-87 </label>
          <listPosition>73</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288049</mtid>
          <link>/api/reference/2288049</link>
          <label>74. Van Ackooij, W., Henrion, R., Möller, A., Zorgati, R., On probabilistic constraints induced by rectangular sets and multivariate normal distributions (2010) Mathematical Methods of Operations Research, 71 (3), pp. 535-549 </label>
          <listPosition>74</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288050</mtid>
          <link>/api/reference/2288050</link>
          <label>75. Van Ackooij, W., Henrion, R., Möller, A., Zorgati, R., On joint probabilistic constriants with Gaussian Coefficient Matrix (2011) Operations Research Letters, 39, pp. 99-102 </label>
          <listPosition>75</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288051</mtid>
          <link>/api/reference/2288051</link>
          <label>76. Van Ackooij, W., Henrion, R., Möller, A., Zorgati, R., Joint chance constrained programming for hydro reservoir management (2014) Optimization and Engineering, 15, pp. 509-531 </label>
          <listPosition>76</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288052</mtid>
          <link>/api/reference/2288052</link>
          <label>77. Van Ackooij, W., Sagastizábal, C., Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems (2014) Siam Journal on Optimization, 24 (2), pp. 733-765 </label>
          <listPosition>77</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288053</mtid>
          <link>/api/reference/2288053</link>
          <label>78. Van De Panne, C., Popp, W., Minimum-cost cattle feed under probabilistic protein constraints (1963) Managment Science, 9, pp. 405-430 </label>
          <listPosition>78</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288054</mtid>
          <link>/api/reference/2288054</link>
          <label>79. Veinott, A.F., The supporting hyperplane method for unimodal programming (1967) Operations Research, 15, pp. 147-152 </label>
          <listPosition>79</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288055</mtid>
          <link>/api/reference/2288055</link>
          <label>80. Vízvári, B., The integer programming background of a stochastic integer programming algorithm of Dentcheva-Prékopa-Ruszczyński (2002) Optimization Methods and Software, 17, pp. 543-559 </label>
          <listPosition>80</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
        <reference>
          <otype>Reference</otype>
          <mtid>2288056</mtid>
          <link>/api/reference/2288056</link>
          <label>81. Zoutendijk, G., (1960) Methods of Feasible Directions: A Study in Linear and Non-Linear Programming, , Elsevier Publishing Co., Amsterdam</label>
          <listPosition>81</listPosition>
          <published>false</published>
          <snippet>true</snippet>
        </reference>
      </references>
      <link>/api/publication/3323588</link>
      <label>Csaba I Fábián et al. Probability maximization by inner approximation. (2018) ACTA POLYTECHNICA HUNGARICA 1785-8860 1785-8860 15 1 105-125</label><template>&lt;div class=&quot;JournalArticle Publication short-list&quot;&gt; &lt;div class=&quot;authors&quot;&gt; &lt;span class=&quot;author-name&quot; mtid=&quot;10010616&quot;&gt; &lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10010616&quot; target=&quot;_blank&quot;&gt;Csaba, I Fábián&lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; mtid=&quot;10049404&quot;&gt; &lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10049404&quot; target=&quot;_blank&quot;&gt;Edit, Csizmás&lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; mtid=&quot;10037855&quot;&gt; &lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10037855&quot; target=&quot;_blank&quot;&gt;Rajmund, Drenyovszki&lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; &gt; Wim, van Ackooij &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; mtid=&quot;10013249&quot;&gt; &lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10013249&quot; target=&quot;_blank&quot;&gt;Tibor, Vajnai&lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; mtid=&quot;10003406&quot;&gt; &lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10003406&quot; target=&quot;_blank&quot;&gt;Lóránt, Kovács&lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; ; &lt;span class=&quot;author-name&quot; mtid=&quot;10001251&quot;&gt; &lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10001251&quot; target=&quot;_blank&quot;&gt;Tamás, Szántai&lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-type&quot;&gt; &lt;/span&gt; &lt;/div &gt;&lt;div class=&quot;title&quot;&gt;&lt;a href=&quot;/gui2/?mode=browse&amp;params=publication;3323588&quot; mtid=&quot;3323588&quot; target=&quot;_blank&quot;&gt;Probability maximization by inner approximation&lt;/a&gt;&lt;/div&gt; &lt;div class=&quot;pub-info&quot;&gt; &lt;span class=&quot;journal-title&quot;&gt;ACTA POLYTECHNICA HUNGARICA&lt;/span&gt; &lt;span class=&quot;journal-volume&quot;&gt;15&lt;/span&gt; : &lt;span class=&quot;journal-issue&quot;&gt;1&lt;/span&gt; &lt;span class=&quot;page&quot;&gt; pp. 105-125. , 21 p. &lt;/span&gt; &lt;span class=&quot;year&quot;&gt;(2018)&lt;/span&gt; &lt;/div&gt; &lt;div class=&quot;pub-end&quot;&gt;&lt;div class=&quot;identifier-list&quot;&gt; &lt;span class=&quot;identifiers&quot;&gt; &lt;span class=&quot;id identifier oa_GOLD&quot; title=&quot; Gold &quot;&gt; &lt;a style=&quot;color:blue&quot; title=&quot;10.12700/APH.15.1.2018.1.7&quot; target=&quot;_blank&quot; href=&quot;https://doi.org/10.12700/APH.15.1.2018.1.7&quot;&gt; DOI &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt; &lt;a style=&quot;color:blue&quot; title=&quot;000422898300007&quot; target=&quot;_blank&quot; href=&quot;https://www.webofscience.com/wos/woscc/full-record/000422898300007&quot;&gt; WoS &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt; &lt;a style=&quot;color:blue&quot; title=&quot;85045186431&quot; target=&quot;_blank&quot; href=&quot;http://www.scopus.com/record/display.url?origin=inward&amp;eid=2-s2.0-85045186431&quot;&gt; Scopus &lt;/a&gt; &lt;/span&gt; &lt;/span&gt; &lt;/div&gt; &lt;div class=&quot;short-pub-prop-list&quot;&gt; &lt;span class=&quot;deleted-record&quot;&gt;Központi kezelésű&lt;/span&gt; &lt;span class=&quot;short-pub-mtid&quot;&gt; Közlemény:3323588 &lt;/span&gt; &lt;span class=&quot;status-holder&quot;&gt;&lt;span class=&quot;status-data status-VALIDATED&quot;&gt; Egyeztetett &lt;/span&gt;&lt;/span&gt; &lt;span class=&quot;pub-core&quot;&gt;Forrás Idéző &lt;/span&gt; &lt;span class=&quot;pub-type&quot;&gt;Folyóiratcikk (Szakcikk ) &lt;/span&gt; &lt;!-- &amp;&amp; !record.category.scientific --&gt; &lt;span class=&quot;pub-category&quot;&gt;Tudományos&lt;/span&gt; &lt;div class=&quot;publication-citation&quot; style=&quot;margin-left: 0.5cm;&quot;&gt; &lt;span title=&quot;Nyilvános idézőközlemények összesen, említések nélkül&quot; class=&quot;citingPub-count&quot;&gt;Nyilvános idéző összesen: 12&lt;/span&gt; | Független: 6 | Függő: 6 | Nem jelölt: 0 | WoS jelölt: 8 | Scopus jelölt:&amp;nbsp;6 | WoS/Scopus jelölt:&amp;nbsp;8 | DOI jelölt:&amp;nbsp;9 &lt;/div&gt; &lt;/div&gt; &lt;/div&gt; &lt;/div&gt;</template><template2>&lt;div class=&quot;JournalArticle Publication long-list&quot;&gt; &lt;div class=&quot;authors&quot;&gt; &lt;img title=&quot;Forrásközlemény&quot; style=&quot;float: left&quot; src=&quot;/frontend/resources/grid/publication-core-icon.png&quot;&gt; &lt;img title=&quot;Idézőközlemény&quot; style=&quot;float: left&quot; src=&quot;/frontend/resources/grid/publication-citation-icon.png&quot;&gt; &lt;div class=&quot;autype autype0&quot;&gt; &lt;span class=&quot;author-name&quot; mtid=&quot;10010616&quot;&gt;&lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10010616&quot; target=&quot;_blank&quot;&gt;Csaba I Fábián (&lt;span class=&quot;authorship-author-name&quot;&gt;Fábián Csaba&lt;/span&gt; &lt;span class=&quot;authorAux-mtmt&quot;&gt; Matematikai és számítástudományok&lt;/span&gt;) &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-affil&quot;&gt;&lt;span title=&quot;Neumann János Egyetem&quot;&gt;NJE&lt;/span&gt;/&lt;span title=&quot;GAMF Műszaki és Informatikai Kar&quot;&gt;GAMFK&lt;/span&gt;/Informatika Tanszék&lt;/span&gt; ;&amp;nbsp;&amp;nbsp;&amp;nbsp; &lt;span class=&quot;author-name&quot; mtid=&quot;10049404&quot;&gt;&lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10049404&quot; target=&quot;_blank&quot;&gt;Edit Csizmás (&lt;span class=&quot;authorship-author-name&quot;&gt;Gurka Dezsőné Csizmás Edit Margit&lt;/span&gt; &lt;span class=&quot;authorAux-mtmt&quot;&gt; Informatika&lt;/span&gt;) &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-affil&quot;&gt;&lt;span title=&quot;Neumann János Egyetem&quot;&gt;NJE&lt;/span&gt;/&lt;span title=&quot;GAMF Műszaki és Informatikai Kar&quot;&gt;GAMFK&lt;/span&gt;/Informatika Tanszék&lt;/span&gt; ;&amp;nbsp;&amp;nbsp;&amp;nbsp; &lt;span class=&quot;author-name&quot; mtid=&quot;10037855&quot;&gt;&lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10037855&quot; target=&quot;_blank&quot;&gt;Rajmund Drenyovszki (&lt;span class=&quot;authorship-author-name&quot;&gt;Drenyovszki Rajmund&lt;/span&gt; &lt;span class=&quot;authorAux-mtmt&quot;&gt; Informatikai Tudományok&lt;/span&gt;) &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-affil&quot;&gt;&lt;span title=&quot;Neumann János Egyetem&quot;&gt;NJE&lt;/span&gt;/&lt;span title=&quot;GAMF Műszaki és Informatikai Kar&quot;&gt;GAMFK&lt;/span&gt;/Informatika Tanszék&lt;/span&gt; ;&amp;nbsp;&amp;nbsp;&amp;nbsp; &lt;span class=&quot;author-name&quot; &gt;Wim van Ackooij &lt;/span&gt; ;&amp;nbsp;&amp;nbsp;&amp;nbsp; &lt;span class=&quot;author-name&quot; mtid=&quot;10013249&quot;&gt;&lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10013249&quot; target=&quot;_blank&quot;&gt;Tibor Vajnai (&lt;span class=&quot;authorship-author-name&quot;&gt;Vajnai Tibor&lt;/span&gt; &lt;span class=&quot;authorAux-mtmt&quot;&gt; Elektronspektroszkópia&lt;/span&gt;) &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-affil&quot;&gt;&lt;span title=&quot;Neumann János Egyetem&quot;&gt;NJE&lt;/span&gt;/&lt;span title=&quot;GAMF Műszaki és Informatikai Kar&quot;&gt;GAMFK&lt;/span&gt;/Informatika Tanszék&lt;/span&gt; ;&amp;nbsp;&amp;nbsp;&amp;nbsp; &lt;span class=&quot;author-name&quot; mtid=&quot;10003406&quot;&gt;&lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10003406&quot; target=&quot;_blank&quot;&gt;Lóránt Kovács (&lt;span class=&quot;authorship-author-name&quot;&gt;Kovács Lóránt&lt;/span&gt; &lt;span class=&quot;authorAux-mtmt&quot;&gt; Hálózatmenedzsment&lt;/span&gt;) &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-affil&quot;&gt;&lt;span title=&quot;Neumann János Egyetem&quot;&gt;NJE&lt;/span&gt;/&lt;span title=&quot;GAMF Műszaki és Informatikai Kar&quot;&gt;GAMFK&lt;/span&gt;/Informatika Tanszék&lt;/span&gt; ;&amp;nbsp;&amp;nbsp;&amp;nbsp; &lt;span class=&quot;author-name&quot; mtid=&quot;10001251&quot;&gt;&lt;a href=&quot;/gui2/?type=authors&amp;mode=browse&amp;sel=10001251&quot; target=&quot;_blank&quot;&gt;Tamás Szántai (&lt;span class=&quot;authorship-author-name&quot;&gt;Szántai Tamás&lt;/span&gt; &lt;span class=&quot;authorAux-mtmt&quot;&gt; Operációkutatás&lt;/span&gt;) &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;author-affil&quot;&gt;&lt;span title=&quot;Budapesti Műszaki és Gazdaságtudományi Egyetem&quot;&gt;BME&lt;/span&gt;/&lt;span title=&quot;Természettudományi Kar&quot;&gt;TTK&lt;/span&gt;/&lt;span title=&quot;Matematika Intézet&quot;&gt;MI&lt;/span&gt;/Differenciálegyenletek Tanszék&lt;/span&gt; &lt;/div&gt; &lt;/div&gt; &lt;div class=&quot;title&quot;&gt;&lt;a href=&quot;/gui2/?mode=browse&amp;params=publication;3323588&quot; target=&quot;_blank&quot;&gt;Probability maximization by inner approximation&lt;/a&gt;&lt;/div&gt; &lt;div&gt; &lt;span class=&quot;journal-title&quot;&gt;ACTA POLYTECHNICA HUNGARICA&lt;/span&gt; &lt;span class=&quot;journal-issn&quot;&gt;(&lt;a target=&quot;_blank&quot; href=&quot;https://portal.issn.org/resource/ISSN/1785-8860&quot;&gt;1785-8860&lt;/a&gt; &lt;a target=&quot;_blank&quot; href=&quot;https://portal.issn.org/resource/ISSN/1785-8860&quot;&gt;1785-8860&lt;/a&gt;)&lt;/span&gt;: &lt;span class=&quot;journal-volume&quot;&gt;15&lt;/span&gt; &lt;span class=&quot;journal-issue&quot;&gt;1&lt;/span&gt; &lt;span class=&quot;page&quot;&gt; pp 105-125 &lt;/span&gt; &lt;span class=&quot;year&quot;&gt;(2018)&lt;/span&gt; &lt;/div&gt; &lt;div class=&quot;pub-footer&quot;&gt;  &lt;span class=&quot;language&quot; xmlns=&quot;http://www.w3.org/1999/html&quot;&gt;Nyelv: Angol | &lt;/span&gt; &lt;span class=&quot;identifiers&quot;&gt; &lt;span class=&quot;id identifier oa_GOLD&quot; title=&quot; Gold &quot;&gt; &lt;a style=&quot;color:blue&quot; title=&quot;10.12700/APH.15.1.2018.1.7&quot; target=&quot;_blank&quot; href=&quot;https://doi.org/10.12700/APH.15.1.2018.1.7&quot;&gt; DOI &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt; &lt;a style=&quot;color:blue&quot; title=&quot;000422898300007&quot; target=&quot;_blank&quot; href=&quot;https://www.webofscience.com/wos/woscc/full-record/000422898300007&quot;&gt; WoS &lt;/a&gt; &lt;/span&gt; &lt;span class=&quot;id identifier oa_none&quot; title=&quot;none&quot;&gt; &lt;a style=&quot;color:blue&quot; title=&quot;85045186431&quot; target=&quot;_blank&quot; href=&quot;http://www.scopus.com/record/display.url?origin=inward&amp;eid=2-s2.0-85045186431&quot;&gt; Scopus &lt;/a&gt; &lt;/span&gt; &lt;/span&gt; &lt;OnlyViewableByAuthor&gt;&lt;div class=&quot;ratings&quot;&gt; &lt;div class=&quot;journal-subject&quot;&gt;Folyóirat szakterülete: Scopus - Engineering (miscellaneous)&amp;nbsp;&amp;nbsp;&amp;nbsp;SJR indikátor:&amp;nbsp;Q2&lt;/div&gt; &lt;div class=&quot;journal-subject&quot;&gt;Folyóirat szakterülete: Scopus - Multidisciplinary&amp;nbsp;&amp;nbsp;&amp;nbsp;SJR indikátor:&amp;nbsp;Q2&lt;/div&gt; &lt;div class=&quot;journal-subject&quot;&gt;X. Földtudományok Osztálya XFO&amp;nbsp;&amp;nbsp;&amp;nbsp;A&lt;/div&gt; &lt;/div&gt;&lt;/OnlyViewableByAuthor&gt; &lt;div class=&quot;publication-citation&quot; style=&quot;margin-left: 0.5cm;&quot;&gt; &lt;span title=&quot;Nyilvános idézőközlemények összesen, említések nélkül&quot; class=&quot;citingPub-count&quot;&gt;Nyilvános idéző összesen: 12&lt;/span&gt; | Független: 6 | Függő: 6 | Nem jelölt: 0 | WoS jelölt: 8 | Scopus jelölt:&amp;nbsp;6 | WoS/Scopus jelölt:&amp;nbsp;8 | DOI jelölt:&amp;nbsp;9 &lt;/div&gt;   &lt;div class=&quot;publication-citation&quot;&gt; &lt;a target=&quot;_blank&quot; href=&quot;/api/publication?cond=citations.related;eq;3323588&amp;sort=publishedYear,desc&amp;sort=title&quot;&gt; Idézett közlemények száma: 11 &lt;/a&gt; &lt;/div&gt; &lt;div class=&quot;mtid&quot;&gt;&lt;span class=&quot;long-pub-mtid&quot;&gt;Közlemény: 3323588&lt;/span&gt; | &lt;span class=&quot;status-data status-VALIDATED&quot;&gt; Egyeztetett &lt;/span&gt; &lt;span class=&quot;oldId&quot;&gt;Régi azonosító: 3323588&lt;/span&gt; | Forrás Idéző | &lt;span class=&quot;type-subtype&quot;&gt;Folyóiratcikk ( Szakcikk ) &lt;/span&gt; | &lt;span class=&quot;pub-category&quot;&gt;Tudományos&lt;/span&gt; | &lt;span class=&quot;publication-sourceOfData&quot;&gt;kézi felvitel&lt;/span&gt; &lt;/div&gt; &lt;div class=&quot;lastModified&quot;&gt;Utolsó módosítás: 2020.12.22. 21:31 Szuper Admin (admin) &lt;/div&gt; &lt;div class=&quot;lockedBy&quot;&gt;Központi kezelésű 2019.03.28. 16:11 Lévayné Deseő Katalin (MTMT Központi admin) &lt;/div&gt; &lt;/div&gt;&lt;/div&gt;</template2>
    </publication>
  </content>
</myciteResult>
