The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints

Saved in:
Bibliographic Details
Published in:SIAM journal on optimization 2023-01, Vol.33 (4), p.2909-2934
Main Authors: Bärmann, Andreas, Martin, Alexander, Schneider, Oskar
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c231t-819ee26c3af4b31d680c679c393ec9a6dcf830b308f4caab91474946354e069b3
cites cdi_FETCH-LOGICAL-c231t-819ee26c3af4b31d680c679c393ec9a6dcf830b308f4caab91474946354e069b3
container_end_page 2934
container_issue 4
container_start_page 2909
container_title SIAM journal on optimization
container_volume 33
creator Bärmann, Andreas
Martin, Alexander
Schneider, Oskar
description
doi_str_mv 10.1137/22M147579X
format article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1137_22M147579X</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1137_22M147579X</sourcerecordid><originalsourceid>FETCH-LOGICAL-c231t-819ee26c3af4b31d680c679c393ec9a6dcf830b308f4caab91474946354e069b3</originalsourceid><addsrcrecordid>eNpFkEFLwzAYhoMoOKcXf0HOQjTJl6bJUYvOwcYUJngraZrSSG1KkiH799tQ8PQ-pxeeB6FbRu8Zg_KB8zUTZVHqzzM0Y1QXpGRKn5-44ERyEJfoKqUvSqnSUs3QYts7_OQnE7PPRwphcGbE7zvTRm_xWxj2OUwO__jc4_VuyH4aHKn64K3DVRhTjsaPOV2ji84Myd387Rx9vDxvq1ey2iyW1eOKWA4sE8W0c1xaMJ1ogLVSUStLbUGDs9rI1nYKaANUdcIa0-ijjdBCQiEclbqBObr7_bUxpBRdV0_Rf5u4rxmtTwnq_wRwAFFXTkE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints</title><source>LOCUS - SIAM's Online Journal Archive</source><creator>Bärmann, Andreas ; Martin, Alexander ; Schneider, Oskar</creator><creatorcontrib>Bärmann, Andreas ; Martin, Alexander ; Schneider, Oskar</creatorcontrib><identifier>ISSN: 1052-6234</identifier><identifier>EISSN: 1095-7189</identifier><identifier>DOI: 10.1137/22M147579X</identifier><language>eng</language><ispartof>SIAM journal on optimization, 2023-01, Vol.33 (4), p.2909-2934</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c231t-819ee26c3af4b31d680c679c393ec9a6dcf830b308f4caab91474946354e069b3</citedby><cites>FETCH-LOGICAL-c231t-819ee26c3af4b31d680c679c393ec9a6dcf830b308f4caab91474946354e069b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,3185,27924,27925</link.rule.ids></links><search><creatorcontrib>Bärmann, Andreas</creatorcontrib><creatorcontrib>Martin, Alexander</creatorcontrib><creatorcontrib>Schneider, Oskar</creatorcontrib><title>The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints</title><title>SIAM journal on optimization</title><issn>1052-6234</issn><issn>1095-7189</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNpFkEFLwzAYhoMoOKcXf0HOQjTJl6bJUYvOwcYUJngraZrSSG1KkiH799tQ8PQ-pxeeB6FbRu8Zg_KB8zUTZVHqzzM0Y1QXpGRKn5-44ERyEJfoKqUvSqnSUs3QYts7_OQnE7PPRwphcGbE7zvTRm_xWxj2OUwO__jc4_VuyH4aHKn64K3DVRhTjsaPOV2ji84Myd387Rx9vDxvq1ey2iyW1eOKWA4sE8W0c1xaMJ1ogLVSUStLbUGDs9rI1nYKaANUdcIa0-ijjdBCQiEclbqBObr7_bUxpBRdV0_Rf5u4rxmtTwnq_wRwAFFXTkE</recordid><startdate>20230101</startdate><enddate>20230101</enddate><creator>Bärmann, Andreas</creator><creator>Martin, Alexander</creator><creator>Schneider, Oskar</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20230101</creationdate><title>The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints</title><author>Bärmann, Andreas ; Martin, Alexander ; Schneider, Oskar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c231t-819ee26c3af4b31d680c679c393ec9a6dcf830b308f4caab91474946354e069b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bärmann, Andreas</creatorcontrib><creatorcontrib>Martin, Alexander</creatorcontrib><creatorcontrib>Schneider, Oskar</creatorcontrib><collection>CrossRef</collection><jtitle>SIAM journal on optimization</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bärmann, Andreas</au><au>Martin, Alexander</au><au>Schneider, Oskar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints</atitle><jtitle>SIAM journal on optimization</jtitle><date>2023-01-01</date><risdate>2023</risdate><volume>33</volume><issue>4</issue><spage>2909</spage><epage>2934</epage><pages>2909-2934</pages><issn>1052-6234</issn><eissn>1095-7189</eissn><doi>10.1137/22M147579X</doi><tpages>26</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1052-6234
ispartof SIAM journal on optimization, 2023-01, Vol.33 (4), p.2909-2934
issn 1052-6234
1095-7189
language eng
recordid cdi_crossref_primary_10_1137_22M147579X
source LOCUS - SIAM's Online Journal Archive
title The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T22%3A31%3A29IST&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=The%20Bipartite%20Boolean%20Quadric%20Polytope%20with%20Multiple-Choice%20Constraints&rft.jtitle=SIAM%20journal%20on%20optimization&rft.au=B%C3%A4rmann,%20Andreas&rft.date=2023-01-01&rft.volume=33&rft.issue=4&rft.spage=2909&rft.epage=2934&rft.pages=2909-2934&rft.issn=1052-6234&rft.eissn=1095-7189&rft_id=info:doi/10.1137/22M147579X&rft_dat=%3Ccrossref%3E10_1137_22M147579X%3C/crossref%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c231t-819ee26c3af4b31d680c679c393ec9a6dcf830b308f4caab91474946354e069b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true