Metaheuristics for the minimum gap graph partitioning problem (Q2668747): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3153318158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrated versus hierarchical approach for zone delineation and crop planning under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Partitioning and Graph Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into minimum gap components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Maximally Balanced Connected Partition Problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling technicians and tasks in a telecommunications company / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple Comparisons Among Means / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and complexity of range clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some applications of graph theory to clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a weighted tree into subtrees with weights in a given range / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most uniform path partitioning and its use in image processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landscapes and their correlation functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing for a map sectorization problem by means of mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel refinement for combinatorial optimisation problems / rank
 
Normal rank

Latest revision as of 05:12, 28 July 2024

scientific article
Language Label Description Also known as
English
Metaheuristics for the minimum gap graph partitioning problem
scientific article

    Statements

    Metaheuristics for the minimum gap graph partitioning problem (English)
    0 references
    0 references
    0 references
    7 March 2022
    0 references
    graph partitioning
    0 references
    Tabu search
    0 references
    adaptive large neighborhood search
    0 references

    Identifiers