{"entities":{"Q85432":{"pageid":86704,"ns":120,"title":"Item:Q85432","lastrevid":84592256,"modified":"2026-05-26T19:40:03Z","type":"item","id":"Q85432","labels":{"en":{"language":"en","value":"Local search heuristics for multi-index assignment problems with decomposable costs"}},"descriptions":{"en":{"language":"en","value":"scientific article"}},"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":"Q85432$4321CF46-9383-432B-BC2B-32E1010E4C7F","rank":"normal"}],"P26":[{"mainsnak":{"snaktype":"value","property":"P26","hash":"ce59790de0de9575174a5a1d9a47d4f0fcba1a6a","datavalue":{"value":"55","type":"string"},"datatype":"string"},"type":"statement","id":"Q85432$E3CB0C2D-0944-499C-93C9-C13050EF53AB","rank":"normal"}],"P25":[{"mainsnak":{"snaktype":"value","property":"P25","hash":"bab10b4c5bb968455e4422f5473f104e06be89dd","datavalue":{"value":"7","type":"string"},"datatype":"string"},"type":"statement","id":"Q85432$34238AF8-4B06-46E7-B50A-CDF342EB1D36","rank":"normal"}],"P128":[{"mainsnak":{"snaktype":"value","property":"P128","hash":"1e9bed8c314e7e806b8cbc24070afcfe136d82c8","datavalue":{"value":"694-704","type":"string"},"datatype":"string"},"type":"statement","id":"Q85432$B979DB18-C730-4631-94DB-A23EA959CB9C","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"78acb081f52a59b1fbc99c85f0d062e1e0af3659","datavalue":{"value":{"time":"+2004-07-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":10,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q85432$B2F91E05-EB10-4E39-A11B-2E051B086E3C","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":"Q85432$AFA09A6B-F9C2-42E1-8F7B-7CDE4A9502C9","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d7f3737a203a3c8c5ca2eed33135a5c054894747","datavalue":{"value":"10.1057/PALGRAVE.JORS.2601723","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q85432$D903602F-D380-40A5-B57A-3D971116495D","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a5f20380464b718d6886f6a6704990684b80e9ff","datavalue":{"value":{"entity-type":"item","numeric-id":3030552,"id":"Q3030552"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q85432$E4C23E37-55E0-41CF-9BAC-65CB97241411","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"35ca2c4a222e3ab6ce666f19654cf973cf9ad4e1","datavalue":{"value":"H-J Bandelt","type":"string"},"datatype":"string"},"type":"statement","id":"Q85432$CBA7B4C8-D25C-49AA-BC97-7E2562881B0D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"5f0a01c8847893eacf85064896c3a3d7af2147bd","datavalue":{"value":"A Maas","type":"string"},"datatype":"string"},"type":"statement","id":"Q85432$46C9EB23-6F16-48B3-8AE5-4E61AD743E53","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"6bb16ada03f31280516d29bb8384ea87f0b793d1","datavalue":{"value":"F C R Spieksma","type":"string"},"datatype":"string"},"type":"statement","id":"Q85432$06A5AA4A-70CD-4FDB-B344-3C725DB783A8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Local search heuristics for multi-index assignment problems with decomposable costs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Local_search_heuristics_for_multi-index_assignment_problems_with_decomposable_costs"}}}}}