Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs (Q2629716): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q233604
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Tao Ye / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014883819 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1305.5610 / 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: Approximating the Cut-Norm via Grothendieck's Inequality / 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: 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: Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Memory Tabu Search for Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diversification-driven tabu search for unconstrained binary quadratic problems / 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: The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases / 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: 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

Latest revision as of 07:24, 12 July 2024

scientific article
Language Label Description Also known as
English
Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs
scientific article

    Statements

    Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 July 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    quadratic programming
    0 references
    Boolean variables
    0 references
    metaheuristics
    0 references
    tabu search
    0 references
    worst-case analysis
    0 references
    0 references
    0 references