{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T04:40:17Z","timestamp":1697776817057},"reference-count":15,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2007,3,9]],"date-time":"2007-03-09T00:00:00Z","timestamp":1173398400000},"content-version":"vor","delay-in-days":8590,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1983,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An intersection assignment for a graph is the assignment of a set to each vertex so that edges correspond to pairs of sets which overlap. Intersection assignments are studied in which each set is a real interval, perhaps of specified minimum length. In particular, linear programming methods are used to see how to minimize the measure of the union of intervals in such an assignment, and how to maximize the sum of the lengths of the intervals in such an assignment. The results have application to a variety of scheduling problems.<\/jats:p>","DOI":"10.1002\/net.3230130301","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T16:17:58Z","timestamp":1178900278000},"page":"317-326","source":"Crossref","is-referenced-by-count":9,"title":["Optimal <i>I<\/i>\u2010Intersection assignments for graphs: A linear programming approach"],"prefix":"10.1002","volume":"13","author":[{"given":"Robert J.","family":"Opsut","sequence":"first","affiliation":[]},{"given":"Fred S.","family":"Roberts","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,9]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.45.11.1607"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1965.15.835"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1964-055-5"},{"key":"e_1_2_1_5_2","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","year":"1980"},{"key":"e_1_2_1_6_2","first-page":"65","article-title":"\u00dcber eine art von graphen","volume":"47","author":"Hajos G.","year":"1957","journal-title":"Internat. Math. Nachr."},{"key":"e_1_2_1_7_2","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"Khachian L. G.","year":"1979","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.4064\/fm-51-1-45-64"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.4064\/fm-33-1-303-307","article-title":"Sur deux propriet\u00e9s des classes d'ensembles","volume":"33","author":"Marczewski E.","year":"1945","journal-title":"Fund. Math."},{"key":"e_1_2_1_10_2","unstructured":"R. J.Opsut Optimization of intersection assignments for graphs. Ph. D. Thesis Rutgers University. To appear."},{"key":"e_1_2_1_11_2","first-page":"479","volume-title":"The Theory and Applications of Graphs","author":"Opsut R. J.","year":"1981"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230130302"},{"key":"e_1_2_1_13_2","volume-title":"Discrete Mathematical Models, with Applications to Social, Biological, and Environmental Problems","author":"Roberts F. S.","year":"1976"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970401"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1979.tb32824.x"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0041-1647(68)90016-6"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230130301","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230130301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T22:54:14Z","timestamp":1697756054000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230130301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,9]]}},"alternative-id":["10.1002\/net.3230130301"],"URL":"https:\/\/doi.org\/10.1002\/net.3230130301","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,9]]}}}