{"entities":{"Q1075253":{"pageid":1086005,"ns":120,"title":"Item:Q1075253","lastrevid":67052178,"modified":"2026-04-12T14:36:37Z","type":"item","id":"Q1075253","labels":{"en":{"language":"en","value":"An algorithm for the periodic solutions in the knapsack problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3950205"}},"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":"Q1075253$3EE54E55-0ECB-4C84-9C8A-1123C6D48197","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"22b70d08d38e2dc782eea3614a25a227610467b0","datavalue":{"value":{"text":"An algorithm for the periodic solutions in the knapsack problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1075253$D812EE59-3BE9-4C16-848F-F62B0221F6F6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"57d5999454bdc1e162f52011294fb0cd6272df95","datavalue":{"value":"0591.90062","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075253$8104741D-21F1-4733-9B1A-EDF5791E170E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"5879e5240b2754f5eeb4c8cd691da7f1a70a808f","datavalue":{"value":"10.1016/0022-247X(85)90219-7","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075253$FA2D3B83-9324-47C5-BFF5-04C1549FBF7C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"a129a5c1077293598bf79ca02fea7b78192a541c","datavalue":{"value":{"entity-type":"item","numeric-id":1075252,"id":"Q1075252"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075253$D61439B7-610A-4D7D-8224-98AFC1668AF8","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"c5ad7b9baf8e531c6b1ad954eb5f2899cc8fe5e5","datavalue":{"value":{"entity-type":"item","numeric-id":85344,"id":"Q85344"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075253$5832EBA1-BB9A-4EF8-A9D2-433964B2FC88","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3c94df5c9af0ede578c52141befd29044de13172","datavalue":{"value":{"time":"+1985-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1075253$DE9E254F-6221-418A-AFF7-C0BB3F740C17","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"c9fb243e8bb225e27cc9812ee8eb669a68a93630","datavalue":{"value":"An algorithm is described for directly finding periodic solutions for the knapsack problem, based on the dynamic programming technique.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1075253$D2A7FF1E-E15E-41B2-95D3-A3BEDE99BA10","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"b319b93a96c23968631a1b02958647511bdd2ce8","datavalue":{"value":{"entity-type":"item","numeric-id":593399,"id":"Q593399"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075253$A85C5F0C-0D12-4694-ABFE-2887FC796910","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"3feee98fb6a1a95642ba0c6a16390527874922bf","datavalue":{"value":"90C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075253$076B81EA-8FD4-4146-A0F0-5A21594BE36F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"aa3ca91474fff28e420d9cace433f8447ec799b0","datavalue":{"value":"90C39","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075253$F3410A8E-D21E-4195-A4A9-48FDC480DAAF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075253$1DCE9950-955F-4558-92FC-0E1427DB52C5","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4576c095f8db008142a784d77412afce203a0332","datavalue":{"value":"3950205","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1075253$8B791ABB-E93E-4DA4-8656-C5AA993F4747","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"48ddf43eca498c7e7087cd696beb82ea63925320","datavalue":{"value":"algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1075253$F2B2FBA6-5B2D-4776-BC44-C82BFF764396","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d82d4ce23c845b5cc99dfd2117b687ec0816cbe5","datavalue":{"value":"periodic solutions for the knapsack problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q1075253$8C2FDD58-4C17-4CFB-B700-493B3D224C23","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":"Q1075253$2EBEDC85-F22B-4638-88FD-863BB819981D","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"755b705d434743289f1c33d94607b3327759f7e3","datavalue":{"value":{"entity-type":"item","numeric-id":4142699,"id":"Q4142699"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075253$E18F5DF6-91CD-4D93-9B89-FCD3FB7F7282","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"03f1ddaba8285217bb41a356c810dd9d4f0f25b5","datavalue":{"value":{"entity-type":"item","numeric-id":5595961,"id":"Q5595961"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075253$68BE3F0D-0EC0-46CD-837D-7EE9715ACDE0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"fa74c0bb2c71d8d24f83c953c7f1811531f8473b","datavalue":{"value":{"entity-type":"item","numeric-id":3214706,"id":"Q3214706"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075253$5E019E51-0229-48E2-9EF8-4A10B2BD858F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"444ef82be7aa085e4e525b91df0d015c6d506b67","datavalue":{"value":{"entity-type":"item","numeric-id":5560786,"id":"Q5560786"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075253$07A1E0DB-F099-4485-969E-29EF7DA5A954","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"721f20a86b3fdb7dfd483ce9da3fbd1be30d6e48","datavalue":{"value":{"entity-type":"item","numeric-id":5560785,"id":"Q5560785"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1075253$8B2374D6-39C1-4EFD-9298-42FDCA8ADDAD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An algorithm for the periodic solutions in the knapsack problem","badges":[]}}}}}