A disjunctive cutting plane algorithm for bilinear programming
From MaRDI portal
Publication:6622752
Recommendations
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
- A branch-and-cut algorithm for mixed-integer bilinear programming
- Concavity cuts for disjoint bilinear programming
- Degeneracy removal in cutting plane methods for disjoint bilinear programming
- Location of a conservative hyperplane for cutting plane methods in disjoint bilinear programming
Cites work
- scientific article; zbMATH DE number 5053484 (Why is no real title available?)
- A branch-and-cut method for 0-1 mixed convex programming
- A cutting plane algorithm for solving bilinear programs
- A cutting plane algorithm for the bilinear programming problem
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- A new reformulation-linearization technique for bilinear programming problems
- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems
- Convex Analysis
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Convexification of bilinear forms through non-symmetric lifting
- Disjunctive programming: Properties of the convex hull of feasible points
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Jointly Constrained Biconvex Programming
- Mixed-integer bilinear programming problems
- New SOCP relaxation and branching rule for bipartite bilinear programs
- Nonlinear optimization.
- On the Convergence of Sequences of Convex Sets in Finite Dimensions
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Packing equal circles in a square: A deterministic global optimization approach
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- Solving mixed integer bilinear problems using MILP formulations
- The convex hull of a quadratic constraint over a polytope
- The quickhull algorithm for convex hulls
This page was built for publication: A disjunctive cutting plane algorithm for bilinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622752)
