Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Paramils / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Walksat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PROXIMUS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Hyperheuristics / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2543350326 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.02038 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / 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: Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer programming for the 0--1 maximum probability model. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779809 / 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: 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: ParamILS: An Automatic Algorithm Configuration Framework / 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: Handbook of metaheuristics / 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: The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Maximum Weighted Edge Biclique and Its Applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:12, 15 July 2024

scientific article
Language Label Description Also known as
English
Markov chain methods for the bipartite Boolean quadratic programming problem
scientific article

    Statements

    Markov chain methods for the bipartite Boolean quadratic programming problem (English)
    0 references
    0 references
    0 references
    0 references
    29 May 2018
    0 references
    artificial intelligence
    0 references
    bipartite Boolean quadratic programming
    0 references
    automated heuristic configuration
    0 references
    benchmark
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references