Skip to main navigation
Skip to search
Skip to main content
Experts@Minnesota Home
Search content at Experts@Minnesota
Home
Profiles
Research units
University Assets
Projects and Grants
Research output
Datasets
Press/Media
Activities
Fellowships, Honors, and Prizes
Impacts
Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities
Xiaoyi Gu
, Santanu S. Dey
,
Jean Philippe P. Richard
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Solving Sparse Separable Bilinear Programs Using Lifted Bilinear Cover Inequalities'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Bilinear
100%
Cover Inequalities
100%
Bilinear Program
100%
Bilinear Constraints
66%
Optimization Problem
33%
Constraint Set
33%
Second-order Cone
33%
Root Node
33%
Representable
33%
Computational Experiment
33%
Semidefinite Relaxation
33%
Convex Inequalities
33%
McCormick Relaxations
33%
Bilinear Optimization
33%
Global Solver
33%
Computer Science
Optimization Problem
100%
Semidefinite Programming
100%
Computational Experiment
100%
Constraint Set
100%
Mathematics
Root Node
100%