The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints-Reference-Cited by-同舟云学术

The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints

Published:2023-10-19 Issue:4 Volume:33 Page:2909-2934
ISSN:1052-6234
Container-title:SIAM Journal on Optimization
language:en
Short-container-title:SIAM J. Optim.

Author:

Bärmann Andreas¹,Martin Alexander¹,Schneider Oskar²

Affiliation:

1. Department Mathematik, Friedrich-Alexander-Universität Erlangen-Nürnberg, Cauerstraße 11, 91058, Erlangen, Germany.

2. Fraunhofer-Arbeitsgruppe für Supply Chain Services SCS, Fraunhofer-Institut für Integrierte Schaltungen IIS, Nordostpark 93, 90411, Nürnberg, Germany.

Funder

Bavarian Ministry of Economic Affairs, Regional Development and Energy

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

Theoretical Computer Science,Software,Applied Mathematics

Reference45 articles.

1. Jointly constrained bilinear programs and related problems: An overview

2. A symmetrical linear maxmin approach to disjoint bilinear programming

3. Generating facets for the cut polytope of a graph by triangular elimination

4. Two-party Bell inequalities derived from combinatorics via triangular elimination

5. New classes of facets of the cut polytope and tightness of Imm22 Bell inequalities

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Reciprocity Between Tree Ensemble Optimization and Multilinear Optimization;Operations Research;2024-08-29

2. Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I;Computational Optimization and Applications;2024-01-30