Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10559-011-9368-5 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10559-011-9368-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021542890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 0-1 Quadratic programming approach for optimum solutions of two scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / 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: A unified modeling and solution framework for combinatorial optimization problems / 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: Complexity of uniqueness and local search in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming / 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: Q5491984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for the unconstrained quadratic pseudo-Boolean function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary heuristic for quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic method for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global equilibrium search applied to the unconstrained binary quadratic optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of global equilibrium search / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10559-011-9368-5 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:20, 9 December 2024

scientific article
Language Label Description Also known as
English
Solving unconstrained binary quadratic programming problem by global equilibrium search
scientific article

    Statements

    Solving unconstrained binary quadratic programming problem by global equilibrium search (English)
    0 references
    0 references
    0 references
    30 October 2014
    0 references
    binary quadratic programming
    0 references
    approximate methods
    0 references
    global equilibrium search
    0 references
    computational experiment
    0 references
    comparative analysis of algorithms
    0 references

    Identifiers