{"entities":{"Q6326647":{"pageid":13462091,"ns":120,"title":"Item:Q6326647","lastrevid":94931543,"modified":"2026-06-05T07:59:37Z","type":"item","id":"Q6326647","labels":{"en":{"language":"en","value":"Models and algorithms for the Flying Sidekick Traveling Salesman Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900502801"}},"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":"Q6326647$3D631F66-7318-43AA-984D-793E434B9DE0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b2264ba9368aef03be11721c1d994eeb2733d83d","datavalue":{"value":{"time":"+2019-10-04T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6326647$DF0C4B2D-3FED-4FD0-8AE9-72ABF0C321C7","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"2d3643cf67ed0e212800e97b7b2dced1d37d3b78","datavalue":{"value":{"entity-type":"item","numeric-id":193677,"id":"Q193677"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6326647$85CD15AD-1286-4475-8046-0B3FD1DC98DB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"de44b8b6125ce5efa4bd995e9c49079b333df815","datavalue":{"value":{"entity-type":"item","numeric-id":336341,"id":"Q336341"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6326647$102AA410-EEB8-4D82-926B-39A66FC000EB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"813fb382f606bb23663a196ce94a39364f21b3db","datavalue":{"value":{"entity-type":"item","numeric-id":342355,"id":"Q342355"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6326647$8C0A55C8-6645-406D-BCDF-E71971ED223B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"747e4b9a4b38d1d449190f13e54acf7da74512b6","datavalue":{"value":"900502801","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6326647$6141926E-D8E7-4A08-95A4-E2F4DB6E584D","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":"Q6326647$AF7EB0D0-D09B-494E-8E5D-FBC0ED323C86","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"e908f5fa7e3c1ec6bb179ac54a2f0fa911879b44","datavalue":{"value":"10.1111/ITOR.13030","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6326647$45E6F87B-E163-4C2F-A337-6B2D3FD00CC7","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Models and algorithms for the Flying Sidekick Traveling Salesman Problem","badges":[]}}}}}