A multiple search operator heuristic for the max-k-cut problem (Q513573): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6692526 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
max-k-cut and max-cut | |||
Property / zbMATH Keywords: max-k-cut and max-cut / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
graph partition | |||
Property / zbMATH Keywords: graph partition / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
multiple search strategies | |||
Property / zbMATH Keywords: multiple search strategies / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
tabu list | |||
Property / zbMATH Keywords: tabu list / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
heuristics | |||
Property / zbMATH Keywords: heuristics / rank | |||
Normal rank |
Revision as of 03:31, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A multiple search operator heuristic for the max-k-cut problem |
scientific article |
Statements
A multiple search operator heuristic for the max-k-cut problem (English)
0 references
7 March 2017
0 references
max-k-cut and max-cut
0 references
graph partition
0 references
multiple search strategies
0 references
tabu list
0 references
heuristics
0 references