The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints
From MaRDI portal
Publication:6060149
DOI10.1137/22m147579xarXiv2009.11674OpenAlexW3088794983MaRDI QIDQ6060149
Oskar Schneider, Alexander Martin, Andreas Bärmann
Publication date: 3 November 2023
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.11674
Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The bipartite quadratic assignment problem and extensions
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- On linear programs with linear complementarity constraints
- Relaxations and discretizations for the pooling problem
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
- Extended formulations for convex hulls of some bilinear functions
- Jointly constrained bilinear programs and related problems: An overview
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Correlation polytopes: Their geometry and complexity
- A new reformulation-linearization technique for bilinear programming problems
- The 0-1 knapsack problem with multiple choice constraints
- On the Boolean-quadric packing uncapacitated facility-location polytope
- Cardinality constrained Boolean quadratic polytope
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Staircase compatibility and its applications in scheduling and piecewise linearization
- The bilinear assignment problem: complexity and polynomially solvable special cases
- Geometric proofs for convex hull defining formulations
- The cut polytope and the Boolean quadric polytope
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- Set characterizations and convex extensions for geometric convex-hull proofs
- The clique problem with multiple-choice constraints under a cycle-free dependency graph
- A new separation algorithm for the Boolean quadric and cut polytopes
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities
- A polyhedral approach for a constrained quadratic 0-1 problem
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Generating facets for the cut polytope of a graph by triangular elimination
- The bipartite Boolean quadric polytope
- Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
- Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs
- Solving Mixed Integer Bilinear Problems Using MILP Formulations
- A Polytope for a Product of Real Linear Functions in 0/1 Variables
- Valid Inequalities for the Pooling Problem with Binary Variables
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- A relevant two qubit Bell inequality inequivalent to the CHSH inequality
- Subset Algebra Lift Operators for 0-1 Integer Programming
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- On the cut polytope
- Two-party Bell inequalities derived from combinatorics via triangular elimination
- Geometry of cuts and metrics
- On The Boolean Quadric Forest Polytope
