{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T01:52:08Z","timestamp":1775440328469,"version":"3.50.1"},"publisher-location":"Providence, Rhode Island","reference-count":0,"publisher":"American Mathematical Society","isbn-type":[{"value":"9780821802397","type":"print"},{"value":"9780821870662","type":"print"},{"value":"9781470439781","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995,6,1]]},"DOI":"10.1090\/dimacs\/020\/05","type":"book-chapter","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T22:32:16Z","timestamp":1493245936000},"page":"245-293","source":"Crossref","is-referenced-by-count":28,"title":["Algorithms and reformulations for lot sizing problems"],"prefix":"10.1090","author":[{"given":"Yves","family":"Pochet","sequence":"first","affiliation":[]},{"given":"Laurence","family":"Wolsey","sequence":"additional","affiliation":[]}],"member":"14","container-title":["DIMACS Series in Discrete Mathematics and Theoretical Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T00:55:15Z","timestamp":1775436915000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/dimacs\/020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6,1]]},"ISBN":["9780821802397","9780821870662","9781470439781"],"references-count":0,"URL":"https:\/\/doi.org\/10.1090\/dimacs\/020\/05","relation":{},"ISSN":["1052-1798","2472-4793"],"issn-type":[{"value":"1052-1798","type":"print"},{"value":"2472-4793","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6,1]]}}}