A three-phased local search approach for the clique partitioning problem (Q306093): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-015-9964-9 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / 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/s10878-015-9964-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2298561559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breakout local search for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the clique partitioning problem as a maximally diverse grouping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The noising methods: A generalization of some metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noising methods for a clique partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated responsive threshold search for the quadratic multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Clustering Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient memetic algorithm for the graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for a clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the clique partitioning polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds and constraint propagation techniques for the clique partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for the minimum sum coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gentle Introduction to Memetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique partitioning problem: Facets and patching facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3745273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving group technology problems via clique partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive multistart tabu search approach to solve the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid metaheuristic method for the maximum diversity problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10878-015-9964-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:52, 9 December 2024

scientific article
Language Label Description Also known as
English
A three-phased local search approach for the clique partitioning problem
scientific article

    Statements

    A three-phased local search approach for the clique partitioning problem (English)
    0 references
    0 references
    0 references
    31 August 2016
    0 references
    clique partitioning
    0 references
    restricted neighborhood
    0 references
    tabu search
    0 references
    direct perturbation
    0 references
    heuristic
    0 references
    0 references
    0 references
    0 references

    Identifiers