A polynomial case of unconstrained zero-one quadratic optimization

DOI10.1007/S101070100233MaRDI QIDQ5955560zbMATH OpenOpenAlexFDO

Authors Kim Allemand, Komei Fukuda, Thomas M. Liebling, Erich Steiner

Publication date 2001

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s101070100233, http://infoscience.epfl.ch/record/77398

Mathematics Subject Classification ID

Boolean programming (90C09) Quadratic programming (90C20)

Recommendations

• Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
• New bounds on the unconstrained quadratic integer programming problem
• A solvable case of quadratic 0-1 programming
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case

Cited in

(32)

• A solvable case of quadratic 0-1 programming
• Compact linearization for binary quadratic problems subject to assignment constraints
• The generalized vertex cover problem and some variations
• Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
• Combinatorial optimization with interaction costs: complexity and solvable cases
• Parametric Lagrangian dual for the binary quadratic programming problem
• Spectral theory of Laplace operators on oriented hypergraphs
• A new polynomially solvable class of quadratic optimization problems with box constraints
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
• Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
• A polynomial case of the cardinality-constrained quadratic optimization problem
• Compact linearization for binary quadratic problems
• On the gap between the quadratic integer programming problem and its semidefinite relaxation
• A fast approximation algorithm for solving the complete set packing problem
• A polytope for a product of real linear functions in 0/1 variables
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• New semidefinite programming relaxations for box constrained quadratic program
• On duality gap in binary quadratic programming
• A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search
• Solving unconstrained binary quadratic programming problem by global equilibrium search
• A polynomial case of convex integer quadratic programming problems with box integer constraints
• Complexity and polynomially solvable special cases of QUBO
• An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
• The rotation distance of brooms
• A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
• A normal fan projection algorithm for low-rank optimization
• On reduction of duality gap in quadratic knapsack problems
• Bivalent quadratic optimization with sum-of-square of quadratic penalties
• Models and methods for standardization problems
• Factorized binary polynomial optimization
• New bounds on the unconstrained quadratic integer programming problem
• Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems

This page was built for publication: A polynomial case of unconstrained zero-one quadratic optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5955560)