乐胖代购免代理版

{"id":"https://openalex.org/W2240871647","doi":"https://doi.org/10.1515/macro-2015-0020","title":"Throughput Maximization with S-graph Framework using Global Branching Tree","display_name":"Throughput Maximization with S-graph Framework using Global Branching Tree","publication_year":2015,"publication_date":"2015-03-01","ids":{"openalex":"https://openalex.org/W2240871647","doi":"https://doi.org/10.1515/macro-2015-0020","mag":"2240871647"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1515/macro-2015-0020","pdf_url":null,"source":{"id":"https://openalex.org/S4210215974","display_name":"MACRo 2015","issn_l":"2247-0948","issn":["2247-0948"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5074977777","display_name":"Tibor Holczinger","orcid":"https://orcid.org/0000-0003-4427-9253"},"institutions":[{"id":"https://openalex.org/I140275651","display_name":"University of Pannonia","ror":"https://ror.org/03y5egs41","country_code":"HU","type":"education","lineage":["https://openalex.org/I140275651"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Tibor Holczinger","raw_affiliation_strings":["Department of System and Computer Science, Faculty of Information Technology, Pannon University, Veszpr\u00e9m"],"affiliations":[{"raw_affiliation_string":"Department of System and Computer Science, Faculty of Information Technology, Pannon University, Veszpr\u00e9m","institution_ids":["https://openalex.org/I140275651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033185701","display_name":"\u00c1kos Orosz","orcid":"https://orcid.org/0000-0001-8064-4487"},"institutions":[{"id":"https://openalex.org/I140275651","display_name":"University of Pannonia","ror":"https://ror.org/03y5egs41","country_code":"HU","type":"education","lineage":["https://openalex.org/I140275651"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"\u00c1kos Orosz","raw_affiliation_strings":["Department of System and Computer Science, Faculty of Information Technology, Pannon University, Veszpr\u00e9m"],"affiliations":[{"raw_affiliation_string":"Department of System and Computer Science, Faculty of Information Technology, Pannon University, Veszpr\u00e9m","institution_ids":["https://openalex.org/I140275651"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","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":{"min":0,"max":66},"biblio":{"volume":"1","issue":"1","first_page":"201","last_page":"210"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11053","display_name":"Process Optimization and Integration","score":0.9999,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11053","display_name":"Process Optimization and Integration","score":0.9999,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9976,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9905,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.60339266},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.55066305},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.51917875},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"Breadth-first search","score":0.4225507}],"concepts":[{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.68562233},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6512635},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6440347},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.60339266},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.60243076},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.55066305},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.51917875},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.50504285},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.49764207},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49050254},{"id":"https://openalex.org/C138843760","wikidata":"https://www.wikidata.org/wiki/Q325904","display_name":"Breadth-first search","level":2,"score":0.4225507},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40152165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38963386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2641585},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.19569299},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.067385614},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1515/macro-2015-0020","pdf_url":null,"source":{"id":"https://openalex.org/S4210215974","display_name":"MACRo 2015","issn_l":"2247-0948","issn":["2247-0948"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310313990","host_organization_name":"De Gruyter","host_organization_lineage":["https://openalex.org/P4310313990"],"host_organization_lineage_names":["De Gruyter"],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.63,"id":"https://metadata.un.org/sdg/9"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":4,"referenced_works":["https://openalex.org/W1491978272","https://openalex.org/W1974041901","https://openalex.org/W2031253472","https://openalex.org/W2032609530"],"related_works":["https://openalex.org/W3173319990","https://openalex.org/W3098335909","https://openalex.org/W3006406045","https://openalex.org/W2605620386","https://openalex.org/W2255943860","https://openalex.org/W2037710955","https://openalex.org/W2016341656","https://openalex.org/W2008046591","https://openalex.org/W1978745934","https://openalex.org/W1967528652"],"abstract_inverted_index":{"Abstract":[0],"Majozi":[1],"and":[2],"Friedler":[3],"[3]":[4],"developed":[5,55],"the":[6,17,41,59,65,94],"first":[7],"approach":[8,42,88],"for":[9,16,48,73,97],"throughput":[10],"maximization,":[11],"which":[12],"has":[13,43],"no":[14],"need":[15],"optimal":[18],"number":[19],"of":[20,26,29,61],"time":[21],"points":[22],"a-priori.":[23],"The":[24,86],"feasibility":[25],"a":[27,68],"sequence":[28],"subproblems":[30],"is":[31,71],"examined":[32],"with":[33],"guided":[34],"search":[35],"driven":[36],"S-graph":[37],"based":[38],"approach.":[39],"Although,":[40],"proved":[44],"to":[45,57,92],"be":[46,54],"efficient":[47],"several":[49],"problems":[50],"[1],":[51],"it":[52],"can":[53,81],"further":[56],"increase":[58],"size":[60],"addressable":[62],"cases.":[63],"In":[64],"original":[66],"approach,":[67],"branching":[69],"tree":[70],"generated":[72],"each":[74],"subproblem":[75],"separately,":[76],"even":[77],"though":[78],"these":[79],"trees":[80],"have":[82],"significantly":[83],"large":[84],"overlaps.":[85],"presented":[87],"exploits":[89],"this":[90],"redundancy":[91],"reduce":[93],"computational":[95],"needs":[96],"industrial":[98],"scale":[99],"problems.":[100]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2240871647","counts_by_year":[],"updated_date":"2024-12-15T20:49:06.589263","created_date":"2016-06-24"}