Path relinking for unconstrained binary quadratic programming (Q2253377): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TTTPLOTS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Scatter Search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CirCut / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PERL / 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.1016/j.ejor.2012.07.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2158984240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TTT plots: a perl program to create time-to-target plots / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for modeling and solving set packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining test problems via Internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition Method for Quadratic Zero-One Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP for set packing problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized heuristics for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / 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: Q2731676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter Search and Path Relinking: Advances and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667330 / 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: Diversification-driven tabu search for unconstrained binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the notion of balance of a signed graph / 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: A unified modeling and solution framework for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unconstrained quadratic binary programming approach to the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048590 / 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 hybrid metaheuristic approach to solving the UBQP problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implicit Enumeration Algorithm for Quadratic Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advanced Scatter Search for the Max-Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the maxcut problem by the global equilibrium search / rank
 
Normal rank

Latest revision as of 19:02, 8 July 2024

scientific article
Language Label Description Also known as
English
Path relinking for unconstrained binary quadratic programming
scientific article

    Statements

    Path relinking for unconstrained binary quadratic programming (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 July 2014
    0 references
    UBQP
    0 references
    path relinking
    0 references
    tabu search
    0 references
    maxcut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers