{"entities":{"Q6850486":{"pageid":20599579,"ns":120,"title":"Item:Q6850486","lastrevid":75062920,"modified":"2026-04-17T17:28:36Z","type":"item","id":"Q6850486","labels":{"en":{"language":"en","value":"A best-first branch-and-bound algorithm for orthogonal rectangular packing problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8167000"}},"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":"Q6850486$745D8C5D-2D18-4B5F-8A6F-075BF8E2083A","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"2f355911896bf1478d6f29131122852605a2b800","datavalue":{"value":{"text":"A best-first branch-and-bound algorithm for orthogonal rectangular packing problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6850486$AD8C7488-5EF6-4A9B-954F-255F1C38D313","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"fd61fc95ba2afab2fb019816c58bd0151b0e5267","datavalue":{"value":"10.1111/J.1475-3995.1998.TB00119.X","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6850486$3ABF4AF5-A987-4268-96EE-B8CAF261778E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"97c9edf655b7856699523779b519f21abd1c7c36","datavalue":{"value":{"entity-type":"item","numeric-id":174583,"id":"Q174583"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6850486$8F998EBA-05AA-4842-8315-0972F106EA9D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f1a7eb9b4b1ee5f7a8c10134934d66c6065412ab","datavalue":{"value":{"entity-type":"item","numeric-id":6850485,"id":"Q6850485"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6850486$7639B348-545D-4691-A5E5-16712AADD1F5","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"d8a8511c678dc4094935b29162541fac2e3a8077","datavalue":{"value":{"entity-type":"item","numeric-id":2767661,"id":"Q2767661"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6850486$5F3AA170-4210-4990-BD43-16184E579AB1","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2821da6b58bfbb7c47defbdcb692aa220e781158","datavalue":{"value":{"time":"+2026-03-02T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6850486$B9F83E09-1606-4C02-8304-096C8106D999","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6850486$1A8BA10F-EFF6-4147-9F40-5917B3FEDF01","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"955a6ac68db8c67c1772255c707ed5eb1d2bad2b","datavalue":{"value":"90C57","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6850486$AA144A08-941C-41F4-8398-F91EE7EC50BA","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"fc858c08b17d0763293d883d3b306f245e65fc29","datavalue":{"value":"8167000","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6850486$AE577233-E642-4545-8CEF-FECB22CFB8A6","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":"Q6850486$95D2CAF8-3516-4333-A5D7-05E67EFCC214","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A best-first branch-and-bound algorithm for orthogonal rectangular packing problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_best-first_branch-and-bound_algorithm_for_orthogonal_rectangular_packing_problems"}}}}}