...
机译:模因寻找公平的着色问题
Southeast Univ Sch Cyber Sci & Engn 2 Southeast Univ Rd Nanjing 211189 Peoples R China;
Univ Angers LERIA 2 Blvd Lavoisier F-49045 Angers France|Inst Univ France 1 Rue Descartes F-75231 Paris France;
Natl Univ Singapore Dept Ind Syst Engn & Management Singapore Singapore;
Huazhong Univ Sci & Technol Sch Management 1037 Luoyu Rd Wuhan Peoples R China;
Memetic search; Heuristics; Equitable coloring; Graph coloring;
机译:禁忌搜索,用可行和不可行的搜索来获得相等的颜色
机译:基于回溯的迭代禁忌搜索以实现均等的着色
机译:最大平均度较小的图的均等着色和均等选择
机译:禁忌搜索启发式的均等着色问题
机译:在列表着色问题及其公平变种
机译:基于Memetic Cuckoo-Search的加工镀锌铁的优化
机译:可行和不可行的公平图着色搜索