Pages that link to "Item:Q1186269"
From MaRDI portal
The following pages link to Efficient algorithms for solving rank two and rank three bilinear programming problems (Q1186269):
Displayed 10 items.
- A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- The simplex method as a global optimizer: A \(C\)-programming perspective (Q1315444) (← links)
- Bilinear separation of two sets in \(n\)-space (Q1315445) (← links)
- Calculating a minimal sphere containing a polytope defined by a system of linear inequalities (Q1326513) (← links)
- Linear programs with an additional rank two reverse convex constraint (Q1327432) (← links)
- Generation of disjointly constrained bilinear programming test problems (Q1803651) (← links)
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)