The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PROXIMUS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963979716 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1212.3736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial case of unconstrained zero-one quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Cut-Norm via Grothendieck's Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the Product of Two Linear Functions In 0-1 Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Network Flow Problems Solved with Pseudo-Boolean Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of the Binary Vector That Maximizes a Rank-Deficient Quadratic Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximization of A convex quadratic function under linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonorthogonal decomposition of binary matrices for bounded-error data compression and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially Solvable Cases of Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid metaheuristic approach to solving the UBQP problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cuts and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-sum optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Selection Problem of Shared Fixed Costs and Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum perfect bipartite matchings and spanning trees under categorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Maximum Weighted Edge Biclique and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path relinking for unconstrained binary quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving rank two and rank three bilinear programming problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:02, 10 July 2024

scientific article
Language Label Description Also known as
English
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
scientific article

    Statements

    The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (English)
    0 references
    0 references
    0 references
    0 references
    24 July 2015
    0 references
    quadratic programming
    0 references
    0-1 variables
    0 references
    polynomial algorithms
    0 references
    complexity
    0 references
    pseudo-Boolean programming
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers