Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078140591 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1303.0160 / 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: Algorithms with large domination ratio / 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: On the quality of local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum number of below average triangles in a weighted complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial dominance guarantees for problems with infeasible solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential approximation algorithms for some combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment 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: Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms / 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: 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: Local search and the local structure of NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination analysis for minimum multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination analysis of combinatorial optimization problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP tour domination and Hamilton cycle decompositions of regular digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: z-Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination analysis of greedy heuristics for the frequency assignment problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083206 / 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 some heuristics for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP heuristics: domination analysis and complexity / 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: Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633863 / 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: Q4170156 / 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: Dominance guarantees for above-average solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181524 / 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: Measuring the Quality of Approximate Solutions to Zero-One Programming Problems / rank
 
Normal rank

Latest revision as of 11:07, 9 July 2024

scientific article
Language Label Description Also known as
English
Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
scientific article

    Statements

    Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (English)
    0 references
    0 references
    0 references
    0 references
    22 December 2014
    0 references
    quadratic programming
    0 references
    Boolean variables
    0 references
    heuristics
    0 references
    worst-case analysis
    0 references
    domination analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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