Pages that link to "Item:Q5955560"
From MaRDI portal
The following pages link to A polynomial case of unconstrained zero-one quadratic optimization (Q5955560):
Displaying 30 items.
- New semidefinite programming relaxations for box constrained quadratic program (Q365811) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982) (← links)
- A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569) (← links)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
- On reduction of duality gap in quadratic knapsack problems (Q693132) (← links)
- Models and methods for standardization problems (Q704119) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← links)
- A solvable case of quadratic 0-1 programming (Q1079494) (← links)
- Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
- The generalized vertex cover problem and some variations (Q1756348) (← links)
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531) (← links)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Spectral theory of Laplace operators on oriented hypergraphs (Q2022161) (← links)
- A new polynomially solvable class of quadratic optimization problems with box constraints (Q2047220) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
- A polynomial case of the cardinality-constrained quadratic optimization problem (Q2393087) (← links)
- Compact linearization for binary quadratic problems (Q2477615) (← links)
- On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705) (← links)
- A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
- A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case (Q3544267) (← links)
- A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search (Q4605440) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- The rotation distance of brooms (Q6201876) (← links)
- A normal fan projection algorithm for low-rank optimization (Q6665394) (← links)