{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:52:06Z","timestamp":1724075526872},"reference-count":0,"publisher":"Kaunas University of Technology (KTU)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ITC"],"DOI":"10.5755\/j01.itc.47.4.20103","type":"journal-article","created":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T05:45:54Z","timestamp":1545975954000},"source":"Crossref","is-referenced-by-count":1,"title":["Modified L-shaped Decomposition Method with Scenario Aggregation for a Two-Stage Stochastic Programming Problem"],"prefix":"10.5755","volume":"47","author":[{"given":"Ana","family":"U\u0161purien\u0117","sequence":"first","affiliation":[]},{"given":"Leonidas","family":"Sakalauskas","sequence":"additional","affiliation":[]},{"given":"Gediminas","family":"Gricius","sequence":"additional","affiliation":[]}],"member":"3786","published-online":{"date-parts":[[2018,12,19]]},"container-title":["Information Technology And Control"],"original-title":[],"deposited":{"date-parts":[[2018,12,28]],"date-time":"2018-12-28T06:08:12Z","timestamp":1545977292000},"score":1,"resource":{"primary":{"URL":"http:\/\/itc.ktu.lt\/index.php\/ITC\/article\/view\/20103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,19]]},"references-count":0,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,12,19]]}},"URL":"https:\/\/doi.org\/10.5755\/j01.itc.47.4.20103","relation":{},"ISSN":["2335-884X","1392-124X"],"issn-type":[{"value":"2335-884X","type":"electronic"},{"value":"1392-124X","type":"print"}],"subject":[],"published":{"date-parts":[[2018,12,19]]}}}