{"entities":{"Q6413668":{"pageid":13546763,"ns":120,"title":"Item:Q6413668","lastrevid":95216321,"modified":"2026-06-05T08:37:19Z","type":"item","id":"Q6413668","labels":{"en":{"language":"en","value":"A heuristic algorithm for the Air Transport Unit Consolidation Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900548758"}},"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":"Q6413668$65204B0C-3104-443E-BCFB-5168D5FEBA20","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b8100ea976e153ee716f24d344b922ea5d1ea049","datavalue":{"value":{"time":"+2022-10-12T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6413668$3CF2C731-86EF-474C-A1D5-3D1E31D51276","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7fd38c8352b46a9f71f6d6603d95132f898157bc","datavalue":{"value":{"entity-type":"item","numeric-id":217093,"id":"Q217093"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6413668$9A8CEA06-BF64-4788-B589-593DB3CBC805","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"545ef66a8bd4db2da1082d22f9ba14f128b1f031","datavalue":{"value":{"entity-type":"item","numeric-id":1652248,"id":"Q1652248"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6413668$932F4B83-18A8-46ED-BD1C-B57F93325F0B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e7d6a86e77b6d1532821b06518ca5c3ac65f4fca","datavalue":{"value":{"entity-type":"item","numeric-id":2664337,"id":"Q2664337"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6413668$6BE64EDF-6185-489E-9D04-1A2695ADD51C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f4e09e7af8eb4518491297d477e6838da0afd69a","datavalue":{"value":"900548758","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6413668$A2F33159-6FC2-40EC-97DD-FB8DF5DB83FA","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":"Q6413668$CD8F2F59-A5A4-4993-A86C-73754375158B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A heuristic algorithm for the Air Transport Unit Consolidation Problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_heuristic_algorithm_for_the_Air_Transport_Unit_Consolidation_Problem"}}}}}