A Disjunctive Cutting Plane Algorithm for Bilinear Programming
Gespeichert in:
| Veröffentlicht in: | SIAM journal on optimization 2024-12, Vol.34 (4), p.3286-3313 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 3313 |
|---|---|
| container_issue | 4 |
| container_start_page | 3286 |
| container_title | SIAM journal on optimization |
| container_volume | 34 |
| creator | Rahimian, Hamed Mehrotra, Sanjay |
| description | |
| doi_str_mv | 10.1137/22M1515562 |
| format | Article |
| fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1137_22M1515562</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1137_22M1515562</sourcerecordid><originalsourceid>FETCH-LOGICAL-c120t-9de26fe4b191775f8303c7e54dc557405640754048d80b1e63129196a59f0c653</originalsourceid><addsrcrecordid>eNpFj0tLxDAURoMoOI5u_AVZC9V7k9w8NkKtTxhxFroumTatGfqQtCP473VQcHW-xeGDw9g5wiWiNFdCPCMhkRYHbIHgKDNo3eF-k8i0kOqYnUzTFgCs03bBrnN-G6ftbqjm-Bl4sZvnOLR83fkh8LxrxxTn9543Y-I3sYtD8Imv09gm3_c_4ik7anw3hbM_Ltnb_d1r8ZitXh6einyVVShgzlwdhG6C2qBDY6ixEmRlAqm6IjIKSCswpEDZ2sIGg5YoHDrtyTVQaZJLdvH7W6VxmlJoyo8Ue5--SoRyX17-l8tvW45I9Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Disjunctive Cutting Plane Algorithm for Bilinear Programming</title><source>SIAM Journals Online</source><creator>Rahimian, Hamed ; Mehrotra, Sanjay</creator><creatorcontrib>Rahimian, Hamed ; Mehrotra, Sanjay</creatorcontrib><identifier>ISSN: 1052-6234</identifier><identifier>EISSN: 1095-7189</identifier><identifier>DOI: 10.1137/22M1515562</identifier><language>eng</language><ispartof>SIAM journal on optimization, 2024-12, Vol.34 (4), p.3286-3313</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c120t-9de26fe4b191775f8303c7e54dc557405640754048d80b1e63129196a59f0c653</cites><orcidid>0000-0003-1385-4120 ; 0000-0003-1106-1901</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,3171,27901,27902</link.rule.ids></links><search><creatorcontrib>Rahimian, Hamed</creatorcontrib><creatorcontrib>Mehrotra, Sanjay</creatorcontrib><title>A Disjunctive Cutting Plane Algorithm for Bilinear Programming</title><title>SIAM journal on optimization</title><issn>1052-6234</issn><issn>1095-7189</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNpFj0tLxDAURoMoOI5u_AVZC9V7k9w8NkKtTxhxFroumTatGfqQtCP473VQcHW-xeGDw9g5wiWiNFdCPCMhkRYHbIHgKDNo3eF-k8i0kOqYnUzTFgCs03bBrnN-G6ftbqjm-Bl4sZvnOLR83fkh8LxrxxTn9543Y-I3sYtD8Imv09gm3_c_4ik7anw3hbM_Ltnb_d1r8ZitXh6einyVVShgzlwdhG6C2qBDY6ixEmRlAqm6IjIKSCswpEDZ2sIGg5YoHDrtyTVQaZJLdvH7W6VxmlJoyo8Ue5--SoRyX17-l8tvW45I9Q</recordid><startdate>20241231</startdate><enddate>20241231</enddate><creator>Rahimian, Hamed</creator><creator>Mehrotra, Sanjay</creator><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0003-1385-4120</orcidid><orcidid>https://orcid.org/0000-0003-1106-1901</orcidid></search><sort><creationdate>20241231</creationdate><title>A Disjunctive Cutting Plane Algorithm for Bilinear Programming</title><author>Rahimian, Hamed ; Mehrotra, Sanjay</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c120t-9de26fe4b191775f8303c7e54dc557405640754048d80b1e63129196a59f0c653</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rahimian, Hamed</creatorcontrib><creatorcontrib>Mehrotra, Sanjay</creatorcontrib><collection>CrossRef</collection><jtitle>SIAM journal on optimization</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rahimian, Hamed</au><au>Mehrotra, Sanjay</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Disjunctive Cutting Plane Algorithm for Bilinear Programming</atitle><jtitle>SIAM journal on optimization</jtitle><date>2024-12-31</date><risdate>2024</risdate><volume>34</volume><issue>4</issue><spage>3286</spage><epage>3313</epage><pages>3286-3313</pages><issn>1052-6234</issn><eissn>1095-7189</eissn><doi>10.1137/22M1515562</doi><tpages>28</tpages><orcidid>https://orcid.org/0000-0003-1385-4120</orcidid><orcidid>https://orcid.org/0000-0003-1106-1901</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1052-6234 |
| ispartof | SIAM journal on optimization, 2024-12, Vol.34 (4), p.3286-3313 |
| issn | 1052-6234 1095-7189 |
| language | eng |
| recordid | cdi_crossref_primary_10_1137_22M1515562 |
| source | SIAM Journals Online |
| title | A Disjunctive Cutting Plane Algorithm for Bilinear Programming |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T03%3A36%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Disjunctive%20Cutting%20Plane%20Algorithm%20for%20Bilinear%20Programming&rft.jtitle=SIAM%20journal%20on%20optimization&rft.au=Rahimian,%20Hamed&rft.date=2024-12-31&rft.volume=34&rft.issue=4&rft.spage=3286&rft.epage=3313&rft.pages=3286-3313&rft.issn=1052-6234&rft.eissn=1095-7189&rft_id=info:doi/10.1137/22M1515562&rft_dat=%3Ccrossref%3E10_1137_22M1515562%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |