{"entities":{"Q1155514":{"pageid":1166263,"ns":120,"title":"Item:Q1155514","lastrevid":66396414,"modified":"2026-04-12T09:48:46Z","type":"item","id":"Q1155514","labels":{"en":{"language":"en","value":"A bound and bound algorithm for the zero-one multiple knapsack problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3731749"}},"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":"Q1155514$F037C543-5417-4F97-9F5A-97C830EC0E24","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"171ca193815819eb2f390169ffe410506efd25aa","datavalue":{"value":{"text":"A bound and bound algorithm for the zero-one multiple knapsack problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1155514$FF13CBA3-38A9-433C-8A2C-401DB9FBB2EA","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"21255dc885e9209461fe67b3a197d08808d5c6ff","datavalue":{"value":"0466.90050","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1155514$B6E7375E-BD54-4C3E-87CF-A6F4CA41F42C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8c27ffcebd248f774efa36bf1beb728fa0f704ee","datavalue":{"value":"10.1016/0166-218X(81)90005-6","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1155514$9750B493-58D9-4A1B-AEE5-66C1C9EDBD62","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"03fd981d5df261cfa2446e7ed1d18dfa2af040b2","datavalue":{"value":{"entity-type":"item","numeric-id":193678,"id":"Q193678"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1155514$79ACA359-577A-45F3-8510-B3AC7B986428","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e4f4e50ab5ff3e3fa6e97103b12136833b436f53","datavalue":{"value":{"entity-type":"item","numeric-id":181212,"id":"Q181212"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1155514$24F95703-16D0-4261-8664-A2A2C8780185","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"087f55844cc920aae060b09644168bf17b022e1a","datavalue":{"value":{"entity-type":"item","numeric-id":96294,"id":"Q96294"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1155514$EC0EEE6D-0CDC-49A4-BB14-734F3C48CD14","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"50fad0db7dc87cb4e51866acdb5ccbaa54ec857b","datavalue":{"value":{"time":"+1981-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":"Q1155514$E8D0A518-5E94-48D9-AC62-A05EC5322ECE","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6958ea3363ca9244e0da0201efd237a8410f9a0c","datavalue":{"value":"90C09","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1155514$28DC360A-736B-4615-B8DE-CEAF0693D14B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1155514$54FCADA2-0D02-446D-BA0A-5B4FEC5D3C4E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1155514$F0A9B7E6-B5CE-485F-9FDA-BFEB42493170","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f86a6fbe53413b2b545fe8b5d077321c5d6a0a85","datavalue":{"value":"3731749","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1155514$E3CD8EBC-76B0-41F9-8535-872C76D7F6A4","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8fc86e621803ac1aaeb4f0bf55706a63d32a6a4f","datavalue":{"value":"bound and bound algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q1155514$DC70A8D4-955B-4962-9F8F-47BD0DA91C4D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e2ad414b08fdcaded71bbeaa64f7151b5b303b42","datavalue":{"value":"zero-one multiple knapsack problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q1155514$F432B255-A2C2-4E93-962D-44F4E695E929","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"216c7341b3d18c87670505465521f9e8e23756e1","datavalue":{"value":"tree- search technique","type":"string"},"datatype":"string"},"type":"statement","id":"Q1155514$FC0ABCDE-B10C-4BF4-B6AE-F407A0D81477","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"73365890b656e44b2869c576d0348e365daaf23f","datavalue":{"value":"computational results","type":"string"},"datatype":"string"},"type":"statement","id":"Q1155514$EE7D7F82-A7C5-480E-858F-475251A8EED6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6e87618aee6343e13e99830120698ef319daa4c9","datavalue":{"value":"integer linear programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1155514$06A7E82D-F4BE-4BFE-8C8B-E50F7C259869","rank":"normal"}],"P1463":[{"mainsnak":{"snaktype":"value","property":"P1463","hash":"b0fc6f8fd0b6ac68ea5b1ea97e568e9415a23d63","datavalue":{"value":{"entity-type":"item","numeric-id":37554,"id":"Q37554"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1155514$08D9CBBE-355A-407C-9484-1531006ED6AF","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":"Q1155514$9966D6F5-C994-4829-BED3-B22C7CCB27F1","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"1975591d5d9308514687af3d82e3e82fc5b342d6","datavalue":{"value":{"entity-type":"item","numeric-id":4175050,"id":"Q4175050"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1155514$5E078126-F5DB-41DD-AE0B-2640A32FDB58","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"315ee598c9040e9782bee747455e8ce9a0b9e69c","datavalue":{"value":{"entity-type":"item","numeric-id":4077081,"id":"Q4077081"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1155514$32CE880B-4E23-4FB2-B69B-D38D4A2C7C47","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"b12f577ecb17608fcd09e60751a87188192c6636","datavalue":{"value":{"entity-type":"item","numeric-id":1245074,"id":"Q1245074"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1155514$E9B512A8-AAF0-4C1B-AFDB-7D4EEB341A73","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e1fd6d18dae45b9388d4a2504d92b3397d8eed2b","datavalue":{"value":{"entity-type":"item","numeric-id":1251184,"id":"Q1251184"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1155514$FE2A4C09-DC2C-48E0-BAA6-DCDD58BAA2CE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"48e85d6c8d64b152510eb4508c01159ec937252d","datavalue":{"value":{"entity-type":"item","numeric-id":1142701,"id":"Q1142701"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1155514$FAB11543-EF69-425E-95F0-A4500F1B0EB7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A bound and bound algorithm for the zero-one multiple knapsack problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_bound_and_bound_algorithm_for_the_zero-one_multiple_knapsack_problem"}}}}}