Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
From MaRDI portal
Publication:2369979
DOI10.1007/S10878-006-9625-0zbMATH Open1255.90081OpenAlexW2074049387MaRDI QIDQ2369979FDOQ2369979
Authors: Bettina Klinz, Christophe Meyer, Eranda Çela 
Publication date: 21 June 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-9625-0
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
- Algorithm 457: finding all cliques of an undirected graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A partial k-arboretum of graphs with bounded treewidth
- A New Algorithm for Generating All the Maximal Independent Sets
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- On generating all maximal independent sets
- Arboricity and Subgraph Listing Algorithms
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- On the complexity of integer programming
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- A polynomial case of unconstrained zero-one quadratic optimization
- Minimum cuts and related problems
- LATIN 2004: Theoretical Informatics
- A solvable case of quadratic 0-1 programming
- Graph separation techniques for quadratic zero-one programming
- The basic algorithm for pseudo-Boolean programming revisited
- Biplanar graphs: A survey
- Title not available (Why is that?)
- Corrections to Bierstone's Algorithm for Generating Cliques
- Title not available (Why is that?)
- Maximizing the Product of Two Linear Functions In 0-1 Variables
Cited In (15)
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
- A polytope for a product of real linear functions in 0/1 variables
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
- The bipartite QUBO
- Parametric Lagrangian dual for the binary quadratic programming problem
- Complexity and polynomially solvable special cases of QUBO
- The Boolean quadratic programming problem with generalized upper bound constraints
- A solvable class of quadratic 0-1 programming
- Polynomially solvable cases of binary quadratic programs
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
- On duality gap in binary quadratic programming
- Persistency in 0-1 polynomial programming
- The necessary conditions and the algorithm for a special class of 0-1 quadratic programming problem
- A polynomial case of unconstrained zero-one quadratic optimization
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
Uses Software
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)
