{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:31:39Z","timestamp":1649122299330},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1974,3,1]],"date-time":"1974-03-01T00:00:00Z","timestamp":131328000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[1974,3]]},"DOI":"10.1016\/0305-0548(74)90072-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"15-29","source":"Crossref","is-referenced-by-count":2,"title":["The application of transportation techniques in modelling power pools"],"prefix":"10.1016","volume":"1","author":[{"given":"N.E.","family":"Nour","sequence":"first","affiliation":[]},{"given":"H.H.","family":"Happ","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(74)90072-0_BIB1","series-title":"Diakoptics and Networks","author":"Happ","year":"1971"},{"key":"10.1016\/0305-0548(74)90072-0_BIB2","first-page":"82","article-title":"Gabriel Kr\u00f6n and Systems Theory","author":"Happ","year":"1973"},{"key":"10.1016\/0305-0548(74)90072-0_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/TPAS.1971.292896","article-title":"The inter-area matrix: a tie flow model for power pools","volume":"PAS 90","author":"Happ","year":"1971","journal-title":"IEEE Trans., Power App. Systems"},{"key":"10.1016\/0305-0548(74)90072-0_BIB4","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1968"},{"key":"10.1016\/0305-0548(74)90072-0_BIB5","first-page":"203","article-title":"Operations Research \u2026 methods and problems","author":"Sasieni","year":"1967"},{"key":"10.1016\/0305-0548(74)90072-0_BIB6","first-page":"284","article-title":"Linear Programming","author":"Hadley","year":"1962"},{"key":"10.1016\/0305-0548(74)90072-0_BIB7","series-title":"presented at the Third Hawaii Int. Conf. on System Sciences","article-title":"A shortest route matrix technique","author":"Rathbone","year":"1970"}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054874900720?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054874900720?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T16:23:16Z","timestamp":1552926196000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054874900720"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,3]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,3]]}},"alternative-id":["0305054874900720"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(74)90072-0","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1974,3]]}}}