Solving Graph Partitioning Problems with Parallel Metaheuristics (Q4609771): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Metaheuristic Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3507780 / 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: A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Q3422958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results concerning the complexity of restricted colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of an independence system into independent sets / rank
 
Normal rank

Latest revision as of 08:22, 15 July 2024

scientific article; zbMATH DE number 6852728
Language Label Description Also known as
English
Solving Graph Partitioning Problems with Parallel Metaheuristics
scientific article; zbMATH DE number 6852728

    Statements

    Identifiers