Lifting convex inequalities for bipartite bilinear programs (Q5925639)

scientific article; zbMATH DE number 7662911

Language	Label	Description	Also known as
English	Lifting convex inequalities for bipartite bilinear programs	scientific article; zbMATH DE number 7662911

Statements

instance of

scholarly article

0 references

title

Lifting convex inequalities for bipartite bilinear programs (English)

0 references

author

Xiaoyi Gu

0 references

Santanu S. Dey

0 references

Jean-Philippe P. Richard

0 references

published in

Mathematical Programming. Series A. Series B

0 references

publication date

14 March 2023

0 references

zbMATH Keywords

lifting

0 references

separable bipartite bilinear sets

0 references

subadditivity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10107-021-01759-3

0 references

cites work

Lifting two-integer knapsack inequalities

0 references

On the facets of the mixed-integer knapsack polyhedron

0 references

Sequence Independent Lifting for Mixed-Integer Programming

0 references

Lifting for conic mixed-integer programming

0 references

Lifting properties of maximal lattice-free polyhedra

0 references

Facets of the knapsack polytope

0 references

Disjunctive programming: Properties of the convex hull of feasible points

0 references

Strengthening cuts for mixed integer programs

0 references

Facets of the Knapsack Polytope From Minimal Covers

0 references

Operations that Preserve the Covering Property of the Lifting Region

0 references

Unique Minimal Liftings for Simplicial Polytopes

0 references

Unique lifting of integer variables in minimal inequalities

0 references

Nonunique Lifting of Integer Variables in Minimal Inequalities

0 references

Lectures on Modern Convex Optimization

0 references

Outer-product-free sets for polynomial optimization and oracle-based cuts

0 references

Aggregation-based cutting-planes for packing and covering integer programs

0 references

A gentle, geometric introduction to copositive optimization

0 references

Cutting planes for integer programs with general integer variables

0 references

Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets

0 references

A Geometric Perspective on Lifting

0 references

Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms

0 references

Composite lifting of group inequalities and an application to two-row mixing inequalities

0 references

Constrained Infinite Group Relaxations of MIPs

0 references

Two row mixed-integer cuts via lifting

0 references

New SOCP relaxation and branching rule for bipartite bilinear programs

0 references

Lifting, tilting and fractional programming revisited

0 references

Some continuous functions related to corner polyhedra

0 references

Lifting convex inequalities for bipartite bilinear programs

0 references

Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs

0 references

Sequence independent lifting in mixed integer programming

0 references

Mixing mixed-integer inequalities

0 references

Facet of regular 0–1 polytopes

0 references

Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem

0 references

An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem

0 references

Q3840363

0 references

Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

0 references

Maximal Quadratic-Free Sets

0 references

Lifted Tableaux Inequalities for 0–1 Mixed-Integer Programs: A Computational Study

0 references

Deriving convex hulls through lifting and projection

0 references

On the facial structure of set packing polyhedra

0 references

Technical Note—A Note on Zero-One Programming

0 references

Facets of a mixed-integer bilinear covering set with bounds on variables

0 references

The Group-Theoretic Approach in Mixed Integer Programming

0 references

Lifting inequalities: a framework for generating strong cuts for nonlinear programs

0 references

Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms

0 references

Lifted inequalities for 0-1 mixed integer programming: superlinear lifting

0 references

Valid inequalities for mips and group polyhedra from approximate liftings

0 references

The Convex Hull of a Quadratic Constraint over a Polytope

0 references

Strong valid inequalities for orthogonal disjunctions and bilinear covering sets

0 references

Technical Note—Facets and Strong Valid Inequalities for Integer Programs

0 references

Valid Inequalities and Superadditivity for 0–1 Integer Programs

0 references

A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications

0 references

A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting

0 references

A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting

0 references

Identifiers

DOI

10.1007/s10107-021-01759-3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5925639