{"id":"https://openalex.org/W7123358879","doi":"https://doi.org/10.1109/candarw68385.2025.00037","title":"Multi-color ordering method for minimizing number of colors in quadratic unconstrained binary optimization formulation","display_name":"Multi-color ordering method for minimizing number of colors in quadratic unconstrained binary optimization formulation","publication_year":2025,"publication_date":"2025-11-25","ids":{"openalex":"https://openalex.org/W7123358879","doi":"https://doi.org/10.1109/candarw68385.2025.00037"},"language":null,"primary_location":{"id":"doi:10.1109/candarw68385.2025.00037","is_oa":false,"landing_page_url":"https://doi.org/10.1109/candarw68385.2025.00037","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Thirteenth International Symposium on Computing and Networking Workshops (CANDARW)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122858710","display_name":"Tomohiro Suzuki","orcid":null},"institutions":[{"id":"https://openalex.org/I66906201","display_name":"University of Yamanashi","ror":"https://ror.org/059x21724","country_code":"JP","type":"education","lineage":["https://openalex.org/I66906201"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Tomohiro Suzuki","raw_affiliation_strings":["University of Yamanashi,Graduate School of Engineering,Kofu,Yamanashi,Japan"],"affiliations":[{"raw_affiliation_string":"University of Yamanashi,Graduate School of Engineering,Kofu,Yamanashi,Japan","institution_ids":["https://openalex.org/I66906201"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5122858710"],"corresponding_institution_ids":["https://openalex.org/I66906201"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.76682181,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"173","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.7595999836921692,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.7595999836921692,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.060600001364946365,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.03830000013113022,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/quadratic-unconstrained-binary-optimization","display_name":"Quadratic unconstrained binary optimization","score":0.675000011920929},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5333999991416931},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.527400016784668},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.5260999798774719},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5060999989509583},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4851999878883362},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.46630001068115234}],"concepts":[{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.675000011920929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6104999780654907},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5333999991416931},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.527400016784668},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.5260999798774719},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5060999989509583},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4851999878883362},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.46630001068115234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45739999413490295},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4219000041484833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4187999963760376},{"id":"https://openalex.org/C76946457","wikidata":"https://www.wikidata.org/wiki/Q504843","display_name":"Graph coloring","level":3,"score":0.4092000126838684},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3467000126838684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3465999960899353},{"id":"https://openalex.org/C2983524802","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic model","level":3,"score":0.29249998927116394},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.26489999890327454},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.2603999972343445}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/candarw68385.2025.00037","is_oa":false,"landing_page_url":"https://doi.org/10.1109/candarw68385.2025.00037","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Thirteenth International Symposium on Computing and Networking Workshops (CANDARW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"multi-coloring":[1],"method":[2,44],"can":[3],"be":[4,15],"formulated":[5],"as":[6,62],"a":[7,27,63],"graph":[8,23],"coloring":[9,24],"problem,":[10],"which":[11],"is":[12],"known":[13],"to":[14,45],"NP-hard.":[16],"In":[17],"this":[18],"study,":[19],"we":[20,53],"solve":[21],"the":[22,48,55,58],"problem":[25],"using":[26],"quadratic":[28],"unconstrained":[29],"binary":[30],"optimization":[31],"(QUBO)":[32],"formulation.":[33],"We":[34],"perform":[35],"parameter":[36],"tuning":[37],"and":[38],"propose":[39],"an":[40],"iterative":[41,67],"color":[42],"reduction":[43],"further":[46],"decrease":[47],"number":[49],"of":[50,57],"colors.":[51],"Finally,":[52],"evaluate":[54],"effectiveness":[56],"resulting":[59],"parallel":[60],"ordering":[61],"preprocessing":[64],"step":[65],"for":[66],"methods,":[68],"compared":[69],"with":[70],"conventional":[71],"approaches.":[72]},"counts_by_year":[],"updated_date":"2026-01-14T00:46:21.520733","created_date":"2026-01-14T00:00:00"}