乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T10:18:49Z","timestamp":1726136329371},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030876715"},{"type":"electronic","value":"9783030876722"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87672-2_13","type":"book-chapter","created":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:02:46Z","timestamp":1632258166000},"page":"192-207","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["New Valid Inequalities for a Multi-echelon Multi-item Lot-Sizing Problem with Returns and Lost Sales"],"prefix":"10.1007","author":[{"given":"Franco","family":"Quezada","sequence":"first","affiliation":[]},{"given":"C\u00e9line","family":"Gicquel","sequence":"additional","affiliation":[]},{"given":"Safia","family":"Kedad-Sidhoum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,22]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-51469-7_11","volume-title":"Machine Learning, Optimization, and Big Data","author":"K Akartunal\u0131","year":"2016","unstructured":"Akartunal\u0131, K., Arulselvan, A.: Economic lot-sizing problem with remanufacturing option: complexity and algorithms. In: Pardalos, P.M., Conca, P., Giuffrida, G., Nicosia, G. (eds.) MOD 2016. LNCS, vol. 10122, pp. 132\u2013143. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-51469-7_11"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/j.ijpe.2018.07.002","volume":"203","author":"SAS Ali","year":"2018","unstructured":"Ali, S.A.S., Doostmohammadi, M., Akartunal\u0131, K., van der Meer, R.: A theoretical and computational analysis of lot-sizing in remanufacturing with separate setups. Int. J. Prod. Econ. 203, 276\u2013285 (2018)","journal-title":"Int. J. Prod. Econ."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.dam.2018.07.029","volume":"255","author":"M Bansal","year":"2019","unstructured":"Bansal, M.: Facets for single module and multi-module capacitated lot-sizing problems without backlogging. Discret. Appl. Math. 255, 117\u2013141 (2019)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"13_CR4","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1016\/j.ejor.2017.05.008","volume":"263","author":"N Brahimi","year":"2017","unstructured":"Brahimi, N., Absi, N., Dauz\u00e8re-P\u00e9r\u00e8s, S., Nordli, A.: Single-item dynamic lot-sizing problems: an updated survey. Eur. J. Oper. Res. 263(3), 838\u2013863 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.apm.2016.10.037","volume":"50","author":"JO Cunha","year":"2017","unstructured":"Cunha, J.O., Konstantaras, I., Melo, R.A., Sifaleras, A.: On multi-item economic lot-sizing with remanufacturing and uncapacitated production. Appl. Math. Model. 50, 772\u2013780 (2017)","journal-title":"Appl. Math. Model."},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1287\/opre.1080.0535","volume":"57","author":"Y Guan","year":"2009","unstructured":"Guan, Y., Ahmed, S., Nemhauser, G.L.: Cutting planes for multistage stochastic integer programs. Oper. Res. 57(2), 287\u2013298 (2009)","journal-title":"Oper. Res."},{"issue":"1","key":"13_CR7","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01589110","volume":"45","author":"JM Leung","year":"1989","unstructured":"Leung, J.M., Magnanti, T.L., Vachani, R.: Facets and algorithms for capacitated lot sizing. Math. Program. 45(1), 331\u2013359 (1989)","journal-title":"Math. Program."},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/PL00011411","volume":"89","author":"M Loparic","year":"2001","unstructured":"Loparic, M., Pochet, Y., Wolsey, L.A.: The uncapacitated lot-sizing problem with sales and safety stocks. Math. Program. 89(3), 487\u2013504 (2001)","journal-title":"Math. Program."},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/S0377-2217(99)00461-0","volume":"125","author":"AJ Miller","year":"2000","unstructured":"Miller, A.J., Nemhauser, G.L., Savelsbergh, M.W.: On the capacitated lot-sizing and continuous 0\u20131 knapsack polyhedra. Eur. J. Oper. Res. 125(2), 298\u2013315 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF01582225","volume":"67","author":"Y Pochet","year":"1994","unstructured":"Pochet, Y., Wolsey, L.A.: Polyhedra for lot-sizing with Wagner\u2013whitin costs. Math. Program. 67(1), 297\u2013323 (1994)","journal-title":"Math. Program."},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer Science & Business Media (2006). https:\/\/doi.org\/10.1007\/0-387-33477-7","DOI":"10.1007\/0-387-33477-7"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Quezada, F., Gicquel, C., Kedad-Sidhoum, S., Vu, D.Q.: A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales. Comput. Oper. Res. 116, 104865 (2020)","DOI":"10.1016\/j.cor.2019.104865"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1080\/0740817X.2013.802842","volume":"46","author":"MJ Retel Helmrich","year":"2014","unstructured":"Retel Helmrich, M.J., Jans, R., van den Heuvel, W., Wagelmans, A.P.: Economic lot-sizing with remanufacturing: complexity and efficient formulations. IIE Trans. 46(1), 67\u201386 (2014)","journal-title":"IIE Trans."}],"container-title":["Lecture Notes in Computer Science","Computational Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87672-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,21]],"date-time":"2021-09-21T21:08:30Z","timestamp":1632258510000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87672-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030876715","9783030876722"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87672-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"22 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccl22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccl2021.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"111","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}