{"id":"https://openalex.org/W3206791320","doi":"https://doi.org/10.1007/978-3-030-75801-1_2","title":"Combinatorial Optimization G(V, E)","display_name":"Combinatorial Optimization G(V, E)","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3206791320","doi":"https://doi.org/10.1007/978-3-030-75801-1_2","mag":"3206791320"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-75801-1_2","doi":"https://doi.org/10.1007/978-3-030-75801-1_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-75801-1_2","pdf_url":null,"source":{"id":"https://openalex.org/S4210186983","display_name":"Springer optimization and its applications","issn_l":"1931-6828","issn":["1931-6828","1931-6836"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310319972","host_organization_name":"Springer International Publishing","host_organization_lineage":["https://openalex.org/P4310319972","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer International Publishing","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Springer Optimization and Its Applications","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W3207715911","display_name":"Combinatorial, Linear, Integer and Nonlinear Optimization Apps"},"type":"book-chapter","is_traditional":true,"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/A5101974532","display_name":"James MacGregor Smith","orcid":"https://orcid.org/0000-0002-6147-5806","observed_orcids":["https://orcid.org/0000-0002-6147-5806"]},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. MacGregor Smith","raw_affiliation_strings":["Department of Mechanical and Industrial Engineering, University of Massachusetts, Amherst, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Industrial Engineering, University of Massachusetts, Amherst, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5101974532"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"19","last_page":"82"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.0008999999845400453,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":1.0},{"id":"https://openalex.org/keywords/discrete-optimization","display_name":"discrete optimization","score":0.6840000152587891},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.9269999861717224},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.9100000262260437},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.7279999852180481},{"id":"https://openalex.org/keywords/accessibility-maps","display_name":"accessibility maps","score":0.6420000195503235},{"id":"https://openalex.org/keywords/campus-navigation","display_name":"campus navigation","score":0.6830000281333923}],"concepts":[{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.6968491077423096},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6638513803482056},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6046538352966309},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48871827125549316},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4775579571723938},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4767283499240875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4547644257545471},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44338858127593994},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4236333668231964},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42210400104522705},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4190168082714081},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4135086238384247},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39173609018325806},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.367154598236084},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13911816477775574},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-75801-1_2","doi":"https://doi.org/10.1007/978-3-030-75801-1_2","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-75801-1_2","pdf_url":null,"source":{"id":"https://openalex.org/S4210186983","display_name":"Springer optimization and its applications","issn_l":"1931-6828","issn":["1931-6828","1931-6836"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4310319972","host_organization_name":"Springer International Publishing","host_organization_lineage":["https://openalex.org/P4310319972","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer International Publishing","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Springer Optimization and Its Applications","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7086599787","https://openalex.org/W2961093138","https://openalex.org/W7101070400","https://openalex.org/W4248646415","https://openalex.org/W4210431029","https://openalex.org/W4206505898","https://openalex.org/W3144057026","https://openalex.org/W4416655050","https://openalex.org/W2439379691","https://openalex.org/W7096757088"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-10-10T09:11:00.788812","created_date":"2021-10-25T00:00:00"}