Facets of a mixed-integer bilinear covering set with bounds on variables
From MaRDI portal
Publication:2423814
DOI10.1007/s10898-019-00783-0zbMath1426.90192arXiv1707.06712OpenAlexW2964081927MaRDI QIDQ2423814
Publication date: 20 June 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.06712
Related Items (7)
Cutting Plane Generation through Sparse Principal Component Analysis ⋮ Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem ⋮ On the facet defining inequalities of the mixed-integer bilinear covering set ⋮ The Convex Hull of a Quadratic Constraint over a Polytope ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ Lifting convex inequalities for bipartite bilinear programs ⋮ New SOCP relaxation and branching rule for bipartite bilinear programs
Uses Software
Cites Work
- RLT: A unified approach for discrete and continuous nonconvex optimization
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- The ellipsoid method and its consequences in combinatorial optimization
- A new reformulation-linearization technique for bilinear programming problems
- Different transformations for solving non-convex trim-loss problems by MINLP
- A global optimization algorithm using Lagrangian underestimates and the interval Newton method
- One-dimensional cutting stock problem to minimize the number of different patterns
- On convex relaxations for quadratically constrained quadratic programming
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Quadratic programming is in NP
- Integer Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- Some NP-complete problems in quadratic and nonlinear programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
- An Algorithm for Separable Nonconvex Programming Problems
- Convex Analysis
- Global Optimization and Constraint Satisfaction
This page was built for publication: Facets of a mixed-integer bilinear covering set with bounds on variables
