{"entities":{"Q2355847":{"pageid":2366590,"ns":120,"title":"Item:Q2355847","lastrevid":73759125,"modified":"2026-04-14T17:10:14Z","type":"item","id":"Q2355847","labels":{"en":{"language":"en","value":"Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs''"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6466367"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2355847$82E20F4A-8D61-4A97-8757-2BDF852085F5","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f603c02a30fa1891aa81efc5f7e7d5f18fbc53e7","datavalue":{"value":{"text":"Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs''","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2355847$299DC8AD-B292-4EAC-81C0-8E2DA904F24E","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"58cafb4682831890ed5460489cc464351524dc80","datavalue":{"value":"1317.90024","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2355847$30B5DD5C-FC64-4BB7-A633-38F57387E6A4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"67d0b78a4c3699378204d8267981ecd87c45aee3","datavalue":{"value":{"entity-type":"item","numeric-id":1785292,"id":"Q1785292"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2355847$6026EE20-D009-4886-9450-C60F6E9F066D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"238af284c57bc26fa6aea8a5255faeb0f065999c","datavalue":{"value":{"entity-type":"item","numeric-id":1785293,"id":"Q1785293"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2355847$2F012F7D-699B-4AEF-8881-73C34D5B5177","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"318dfde173ffd1d9b35b457f66e5c925cb96beea","datavalue":{"value":{"entity-type":"item","numeric-id":320791,"id":"Q320791"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2355847$B87EF131-3FE1-4CB7-A110-820A97BF4DEC","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"38576f39a6df37711cb397d1408ced7e3814cc6e","datavalue":{"value":{"entity-type":"item","numeric-id":62319,"id":"Q62319"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2355847$46109731-9365-4F0F-B520-7697B62F21CB","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6f0392469883d19d663812123856ab8685a84c0b","datavalue":{"value":{"time":"+2015-07-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2355847$B65FFFCF-9EB6-4E65-B3A7-46D0D21CE13B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f87676c65161128847f8e2acd745d50c25801ce","datavalue":{"value":"90B05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2355847$471357E2-0DC2-445D-A8C1-531339E95561","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1ccf4347dd83f411f582a03f47c3b1819b4ec540","datavalue":{"value":"6466367","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2355847$CB590AD2-C03E-4DEE-AB25-797140C48172","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2355847$F8BF532B-11C7-43E3-935A-478FD8A9364C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"35a953eee540f04ccbc2f553a08362864232160e","datavalue":{"value":"https://doi.org/10.1016/j.ejor.2013.01.051","type":"string"},"datatype":"url"},"type":"statement","id":"Q2355847$F821DA9F-2E9E-490F-A748-EAD18BAA926D","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"16d4518bb243d1fd21054768eeaf2971b95ae662","datavalue":{"value":"W2013720966","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2355847$07B7F094-4ECE-4125-9A0C-1C0B0D8D4B17","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"893ef8b1b95fe7a55a9337c9bab9ccba4a7cc642","datavalue":{"value":"10.1016/J.EJOR.2013.01.051","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2355847$F7473197-A142-4E30-B7CB-E886626E37BC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs''","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Corrigendum_to_%60%60A_polynomial_time_algorithm_to_solve_the_single-item_capacitated_lot_sizing_problem_with_minimum_order_quantities_and_concave_costs%27%27"}}}}}