{"id":"https://openalex.org/W2278850436","doi":null,"title":"Improving combinatorial optimization","display_name":"Improving combinatorial optimization","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2278850436","mag":"2278850436"},"language":"en","primary_location":{"id":"pmh:oai:jupiter.its.unimelb.edu.au:11343/36679","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/11343/36679","pdf_url":null,"source":{"id":"https://openalex.org/S4377196259","display_name":"Minerva Access (University of Melbourne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I165779595","host_organization_name":"The University of Melbourne","host_organization_lineage":["https://openalex.org/I165779595"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PhD thesis"},"parent_works":[],"lineage":["https://openalex.org/W2278850436"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11343/36679","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109469826","display_name":"Geoffrey Chu","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Geoffrey Chu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5109469826"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":68,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976000189781189,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976000189781189,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0005000000237487257,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9789999723434448},{"id":"https://openalex.org/keywords/constraint-projection","display_name":"constraint projection","score":0.9300000071525574},{"id":"https://openalex.org/keywords/symmetry-breaking","display_name":"symmetry breaking","score":0.7990000247955322},{"id":"https://openalex.org/keywords/dominance","display_name":"dominance","score":0.6420000195503235},{"id":"https://openalex.org/keywords/relaxation","display_name":"relaxation","score":0.6740000247955322},{"id":"https://openalex.org/keywords/parallelization","display_name":"parallelization","score":0.9490000009536743},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"constraint satisfaction","score":0.6309999823570251},{"id":"https://openalex.org/keywords/search-heuristics","display_name":"search heuristics","score":0.7139999866485596}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49209898710250854}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:jupiter.its.unimelb.edu.au:11343/36679","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/11343/36679","pdf_url":null,"source":{"id":"https://openalex.org/S4377196259","display_name":"Minerva Access (University of Melbourne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I165779595","host_organization_name":"The University of Melbourne","host_organization_lineage":["https://openalex.org/I165779595"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PhD thesis"},{"id":"mag:2278850436","doi":null,"is_oa":false,"landing_page_url":"https://minerva-access.unimelb.edu.au/bitstream/11343/36679/1/274380_mythesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:jupiter.its.unimelb.edu.au:11343/36679","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/11343/36679","pdf_url":null,"source":{"id":"https://openalex.org/S4377196259","display_name":"Minerva Access (University of Melbourne)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I165779595","host_organization_name":"The University of Melbourne","host_organization_lineage":["https://openalex.org/I165779595"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PhD thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2278850436.pdf","grobid_xml":"https://content.openalex.org/works/W2278850436.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W1890114378","https://openalex.org/W2044773946","https://openalex.org/W2090757373","https://openalex.org/W2170826919"],"related_works":["https://openalex.org/W2335368585","https://openalex.org/W7046229398","https://openalex.org/W7100801449","https://openalex.org/W2014228444","https://openalex.org/W4247165420","https://openalex.org/W1587243579","https://openalex.org/W221782011","https://openalex.org/W7099947518","https://openalex.org/W7053422622"],"abstract_inverted_index":{"Combinatorial":[0],"Optimization":[1],"is":[2,104],"an":[3,105],"important":[4,20],"area":[5],"of":[6,26,81,107],"computer":[7],"science":[8],"that":[9,48,55],"has":[10],"many":[11],"theoretical":[12],"and":[13,36],"practical":[14],"applications.In":[15],"this":[16,75],"thesis,":[17],"we":[18],"present":[19,95],"contributions":[21],"to":[22,51,63,85],"several":[23],"different":[24,59],"areas":[25],"combinatorial":[27],"optimization,":[28],"including":[29],"nogood":[30,41,76],"learning,":[31],"symmetry":[32,98],"breaking,":[33],"dominance,":[34],"relaxations":[35],"parallelization.We":[37],"develop":[38],"a":[39,86,96],"new":[40,97],"learning":[42,77],"technique":[43,78,100],"based":[44],"on":[45,68],"constraint":[46],"projection":[47],"allows":[49],"us":[50],"exploit":[52],"subproblem":[53],"dominances":[54],"arise":[56],"when":[57],"two":[58],"search":[60],"paths":[61],"lead":[62],"subproblems":[64],"which":[65,89,103],"are":[66],"identical":[67],"the":[69],"remaining":[70],"unlabeled":[71],"variables.On":[72],"appropriate":[73],"problems,":[74],"provides":[79],"orders":[80],"magnitude":[82],"speedup":[83],"compared":[84],"base":[87],"solver":[88],"does":[90],"not":[91],"learn":[92],"nogoods.":[93],"We":[94],"breaking":[99],"called":[101],"SBDS-1UIP,":[102],"extension":[106],"Symmetry":[108],"Breaking":[109],"During":[110],"Search":[111],"(SBDS).":[112],"SBDS-1UIP":[113],"uses":[114],"symmetric":[115]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":15},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}