Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
From MaRDI portal
Publication:2369979
Recommendations
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- A polynomial case of unconstrained zero-one quadratic optimization
- A solvable case of quadratic 0-1 programming
- Polynomially solvable cases of binary quadratic programs
- A solvable class of quadratic 0-1 programming
- A polyhedral approach for a constrained quadratic 0-1 problem
- A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
- A class of polynomially solvable 0-1 programming problems and an application
- A polynomial case of the cardinality-constrained quadratic optimization problem
Cites work
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 4072403 (Why is no real title available?)
- scientific article; zbMATH DE number 3613077 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A New Algorithm for Generating All the Maximal Independent Sets
- A partial k-arboretum of graphs with bounded treewidth
- A polynomial case of unconstrained zero-one quadratic optimization
- A solvable case of quadratic 0-1 programming
- Algorithm 457: finding all cliques of an undirected graph
- Arboricity and Subgraph Listing Algorithms
- Biplanar graphs: A survey
- Corrections to Bierstone's Algorithm for Generating Cliques
- Graph separation techniques for quadratic zero-one programming
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- LATIN 2004: Theoretical Informatics
- Maximizing the Product of Two Linear Functions In 0-1 Variables
- Minimum cuts and related problems
- On generating all maximal independent sets
- On the complexity of integer programming
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- The basic algorithm for pseudo-Boolean programming revisited
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
Cited in
(15)- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- On duality gap in binary quadratic programming
- Complexity and polynomially solvable special cases of QUBO
- A polytope for a product of real linear functions in 0/1 variables
- Persistency in 0-1 polynomial programming
- Parametric Lagrangian dual for the binary quadratic programming problem
- The Boolean quadratic programming problem with generalized upper bound constraints
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
- Polynomially solvable cases of binary quadratic programs
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
- A polynomial case of unconstrained zero-one quadratic optimization
- The bipartite QUBO
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
- The necessary conditions and the algorithm for a special class of 0-1 quadratic programming problem
- A solvable class of quadratic 0-1 programming
This page was built for publication: Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369979)
