Lifting convex inequalities for bipartite bilinear programs
From MaRDI portal
Publication:5918426
DOI10.1007/978-3-030-73879-2_11zbMath1482.90132arXiv2106.12625OpenAlexW3160461831MaRDI QIDQ5918426
Xiaoyi Gu, Jean-Philippe P. Richard, Santanu S. Dey
Publication date: 21 December 2021
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.12625
Related Items
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations ⋮ Lifting convex inequalities for bipartite bilinear programs
Cites Work
- Unnamed Item
- Unique lifting of integer variables in minimal inequalities
- Composite lifting of group inequalities and an application to two-row mixing inequalities
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
- Lifting, tilting and fractional programming revisited
- Lifting for conic mixed-integer programming
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs
- Lifting two-integer knapsack inequalities
- Lifting properties of maximal lattice-free polyhedra
- Valid inequalities for mips and group polyhedra from approximate liftings
- Strengthening cuts for mixed integer programs
- Disjunctive programming: Properties of the convex hull of feasible points
- Cutting planes for integer programs with general integer variables
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
- Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
- On the facets of the mixed-integer knapsack polyhedron
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Deriving convex hulls through lifting and projection
- An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem
- Sequence independent lifting in mixed integer programming
- Convex hull representations for bounded products of variables
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
- New SOCP relaxation and branching rule for bipartite bilinear programs
- A gentle, geometric introduction to copositive optimization
- Facets of a mixed-integer bilinear covering set with bounds on variables
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
- Two row mixed-integer cuts via lifting
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Lectures on Modern Convex Optimization
- Unique Minimal Liftings for Simplicial Polytopes
- Lifted Tableaux Inequalities for 0–1 Mixed-Integer Programs: A Computational Study
- Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms
- Constrained Infinite Group Relaxations of MIPs
- A Geometric Perspective on Lifting
- Operations that Preserve the Covering Property of the Lifting Region
- The Group-Theoretic Approach in Mixed Integer Programming
- Sequence Independent Lifting for Mixed-Integer Programming
- Technical Note—A Note on Zero-One Programming
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Facets of the Knapsack Polytope From Minimal Covers
- Valid Inequalities and Superadditivity for 0–1 Integer Programs
- Maximal Quadratic-Free Sets
- The Convex Hull of a Quadratic Constraint over a Polytope
- On the facial structure of set packing polyhedra
- Nonunique Lifting of Integer Variables in Minimal Inequalities
- A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
- Some continuous functions related to corner polyhedra
- Mixing mixed-integer inequalities
