{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:00:46Z","timestamp":1648666846915},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"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 & Operations Research"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0305-0548(91)90024-l","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"477-485","source":"Crossref","is-referenced-by-count":1,"title":["Linear programming solutions of the truncated moment problem"],"prefix":"10.1016","volume":"18","author":[{"given":"Kun-Jen","family":"Chung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Sobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(91)90024-L_BIB1","series-title":"Comparison Methods for Queues and Other Stochastic Models","author":"Stoyan","year":"1984"},{"key":"10.1016\/0305-0548(91)90024-L_BIB2","series-title":"Inequalities on Distribution Functions","author":"Godwin","year":"1964"},{"key":"10.1016\/0305-0548(91)90024-L_BIB3","series-title":"Mathematical Surveys","article-title":"The Problem of Moments","author":"Shohat","year":"1943"},{"key":"10.1016\/0305-0548(91)90024-L_BIB4","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/moor.8.1.74","article-title":"Extreme points of certain sets of probability measures, with applications","volume":"8","author":"Karr","year":"1983","journal-title":"Math. Opn Res."},{"key":"10.1016\/0305-0548(91)90024-L_BIB5","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1287\/opre.10.5.702","article-title":"Linear programming in a Markov chain","volume":"10","author":"Wolfe","year":"1962","journal-title":"Opn Res."},{"key":"10.1016\/0305-0548(91)90024-L_BIB6","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1287\/opre.25.2.289","article-title":"On a linear programming technique for the steady-state behavior of some queueing systems","volume":"25","author":"Kotiah","year":"1977","journal-title":"Opn Res."},{"key":"10.1016\/0305-0548(91)90024-L_BIB7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/j.1538-7305.1984.tb00006.x","article-title":"On approximations for queues, II: shape constraints","volume":"63","author":"Klincewicz","year":"1984","journal-title":"ATT Bell Lab. Tech. J."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489190024L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489190024L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:21:37Z","timestamp":1552929697000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489190024L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["030505489190024L"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(91)90024-l","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}