Maximizing the Product of Two Linear Functions In 0-1 Variables
From MaRDI portal
Publication:3150259
DOI10.1080/02331930290009847zbMath1006.65065OpenAlexW2083288828MaRDI QIDQ3150259
Pierre Hansen, Peter L. Hammer, David J. jun. Rader, Panos M. Pardalos
Publication date: 4 March 2003
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930290009847
numerical examplespolynomial algorithmsdiscrete variable0-1 variablesmaximizing the product of two linear functions
Related Items
Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem, A Polytope for a Product of Real Linear Functions in 0/1 Variables, Complexity and Polynomially Solvable Special Cases of QUBO, On the complexity and approximation of the maximum expected value all-or-nothing subset, Uniqueness in quadratic and hyperbolic \(0-1\) programming problems, Minimization of ordered, symmetric half-products, Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
