A quality and distance guided hybrid algorithm for the vertex separator problem (Q1652081): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2016.09.012 / rank
Normal rank
 
Property / author
 
Property / author: Li-Ping Xu / rank
Normal rank
 
Property / author
 
Property / author: Li-Ping Xu / 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.cor.2016.09.012 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2522848956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding good approximate vertex and edge partitions is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of the Planar Separator Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separator problem: a polyhedral investigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning planar graphs with vertex costs: Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Separator Cuts in Planar Graphs within Twice the Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separator problem: algorithms and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for solving the vertex separator problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vertex separator problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / 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 Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403581 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2016.09.012 / rank
 
Normal rank

Latest revision as of 01:07, 11 December 2024

scientific article
Language Label Description Also known as
English
A quality and distance guided hybrid algorithm for the vertex separator problem
scientific article

    Statements

    A quality and distance guided hybrid algorithm for the vertex separator problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    vertex separator problem
    0 references
    hybrid metaheuristic algorithm
    0 references
    distance and quality guided tabu search
    0 references
    diversification mechanism
    0 references

    Identifiers