{"id":"https://openalex.org/W1978805095","doi":"https://doi.org/10.1002/net.3230130301","title":"Optimal <i>I</i>\u2010Intersection assignments for graphs: A linear programming approach","display_name":"Optimal <i>I</i>\u2010Intersection assignments for graphs: A linear programming approach","publication_year":1983,"publication_date":"1983-09-01","ids":{"openalex":"https://openalex.org/W1978805095","doi":"https://doi.org/10.1002/net.3230130301","mag":"1978805095"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230130301","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130301","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-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/A5043403044","display_name":"Robert J. Opsut","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Robert J. Opsut","raw_affiliation_strings":["Department of Mathematics, Rutgers University, New Brunswick, New Jersey 08903","DEPARTMENT OF MATHEMATICS, RUTGERS UNIVERSITY, NEW BRUNSWICK, NEW JERSEY 08903"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Rutgers University, New Brunswick, New Jersey 08903","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"DEPARTMENT OF MATHEMATICS, RUTGERS UNIVERSITY, NEW BRUNSWICK, NEW JERSEY 08903","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077527733","display_name":"Fred S. Roberts","orcid":"https://orcid.org/0000-0001-8421-4759"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fred S. Roberts","raw_affiliation_strings":["Department of Mathematics, Rutgers University, New Brunswick, New Jersey 08903","DEPARTMENT OF MATHEMATICS, RUTGERS UNIVERSITY, NEW BRUNSWICK, NEW JERSEY 08903"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Rutgers University, New Brunswick, New Jersey 08903","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"DEPARTMENT OF MATHEMATICS, RUTGERS UNIVERSITY, NEW BRUNSWICK, NEW JERSEY 08903","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043403044"],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.6396,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.81652964,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"13","issue":"3","first_page":"317","last_page":"326"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9940999746322632,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.982200026512146,"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/intersection","display_name":"Intersection (aeronautics)","score":0.6820842027664185},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5944128632545471},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5221652984619141},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5213005542755127},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5143226385116577},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4997873306274414},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4983358383178711},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4563002288341522},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4465383291244507},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4321897625923157},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4253772497177124},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34673011302948},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.13172972202301025},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10933354496955872}],"concepts":[{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6820842027664185},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5944128632545471},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5221652984619141},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5213005542755127},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5143226385116577},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4997873306274414},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4983358383178711},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4563002288341522},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4465383291244507},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4321897625923157},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4253772497177124},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34673011302948},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.13172972202301025},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10933354496955872},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230130301","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130301","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1214985307","https://openalex.org/W1513353427","https://openalex.org/W1517921658","https://openalex.org/W2052186517","https://openalex.org/W2055650273","https://openalex.org/W2063410295","https://openalex.org/W2067188437","https://openalex.org/W2089465933","https://openalex.org/W2091940105","https://openalex.org/W2139973226","https://openalex.org/W2143474538","https://openalex.org/W2331072996","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W2348909947","https://openalex.org/W4292672442","https://openalex.org/W2983685817","https://openalex.org/W4285278887","https://openalex.org/W2995925505","https://openalex.org/W134783735","https://openalex.org/W2365237642","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W4232431455"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"intersection":[2],"assignment":[3,9],"for":[4],"a":[5,11,35,87],"graph":[6],"is":[7,34],"the":[8,55,58,70,73,76],"of":[10,22,39,57,60,72,75,89],"set":[12,33],"to":[13,20,50,53,68,86],"each":[14,32],"vertex":[15],"so":[16],"that":[17],"edges":[18],"correspond":[19],"pairs":[21],"sets":[23],"which":[24,31],"overlap.":[25],"Intersection":[26],"assignments":[27],"are":[28,48],"studied":[29],"in":[30,62,78],"real":[36],"interval,":[37],"perhaps":[38],"specified":[40],"minimum":[41],"length.":[42],"In":[43],"particular,":[44],"linear":[45],"programming":[46],"methods":[47],"used":[49],"see":[51],"how":[52,67],"minimize":[54],"measure":[56],"union":[59],"intervals":[61,77],"such":[63,79],"an":[64,80],"assignment,":[65],"and":[66],"maximize":[69],"sum":[71],"lengths":[74],"assignment.":[81],"The":[82],"results":[83],"have":[84],"application":[85],"variety":[88],"scheduling":[90],"problems.":[91]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}