scientific article; zbMATH DE number 3338972
From MaRDI portal
Publication:5615782
zbMath0213.44902MaRDI QIDQ5615782
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The bipartite quadratic assignment problem and extensions, A note on the solution of bilinear programming problems by reduction to concave minimization, The bilinear assignment problem: complexity and polynomially solvable special cases, Matrix criteria for the pseudo-P-convexity of a quadratic form, Jointly constrained bilinear programs and related problems: An overview, Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, Generalized bilinear programming. I: Models, applications and linear programming relaxation, A cutting plane algorithm for solving bilinear programs, Maximization of A convex quadratic function under linear constraints, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts, On the global minimization of concave functions, Global optimization algorithms for linearly constrained indefinite quadratic problems, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
