{"entities":{"Q6591654":{"pageid":14202811,"ns":120,"title":"Item:Q6591654","lastrevid":100164563,"modified":"2026-06-05T21:32:10Z","type":"item","id":"Q6591654","labels":{"en":{"language":"en","value":"Algorithms for shortest path tour problem in large-scale road network"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7900453"}},"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":"Q6591654$226B30C4-393D-4994-BE27-4CD201D6EF50","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e16bc8d09d95cefb31e1da236db24c17accf4cca","datavalue":{"value":{"text":"Algorithms for shortest path tour problem in large-scale road network","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6591654$1A1966A2-E8EC-4830-A003-3756092C5397","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"da5e966086460e8ab2fb5e1f679f1809522c46cc","datavalue":{"value":"10.1007/978-3-031-49193-1_26","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6591654$10FA7B20-4C31-4B57-9851-297DDABD82C7","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"4d6e1dd3709e1ad5e57dba5c767ebde63013b7e1","datavalue":{"value":{"entity-type":"item","numeric-id":6591651,"id":"Q6591651"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$C9F0DD07-5472-46D5-8F2C-7A70C6831B51","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"cb007a1416b5745242633261598ed92e6e8e13e1","datavalue":{"value":{"entity-type":"item","numeric-id":6591652,"id":"Q6591652"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$199C6A7A-9EB9-48A5-AA9B-AC8BDE8592A2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"abd48f3c77821085c16909524e920041f4c9fda9","datavalue":{"value":{"entity-type":"item","numeric-id":1640836,"id":"Q1640836"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$4783AB65-35EC-41C7-B561-E227CAEAB3BF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"856bc0badc22ade0c09f0fccb639bf9ba6749b4f","datavalue":{"value":{"entity-type":"item","numeric-id":6591653,"id":"Q6591653"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$DA85F695-F181-43CC-BE8B-00DB3CF48AD4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"47eaac136ff1b4a7f3fa538bf6e1183e7993e302","datavalue":{"value":{"entity-type":"item","numeric-id":356767,"id":"Q356767"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$221DA20A-3B76-4AFA-A4F0-8DED0E57520C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"12de9798fd6ee61ffd4df9907750892eb33d7328","datavalue":{"value":{"entity-type":"item","numeric-id":391228,"id":"Q391228"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$3ED8BA81-52ED-4B53-85EF-B8A1904B9AE8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b6cc23cd3dff442fedd6d61c9bd3bb4ed887005a","datavalue":{"value":{"entity-type":"item","numeric-id":666115,"id":"Q666115"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$3C8514C5-E9B1-46DA-A92A-1E328BE13037","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"cb302d03576a285f1f06085fb508f4d96fa60d9a","datavalue":{"value":{"time":"+2024-08-22T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6591654$7C251B73-95C2-4D89-AEF4-2379CCDC5C19","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1397c7d07b55282862d4db12cbe94becf8137559","datavalue":{"value":"68Rxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6591654$5481AB55-2B79-4A89-88A7-1BF6D3C45121","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"baa66a4678b9b3e48a56b09f314898d344d6c06e","datavalue":{"value":"7900453","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6591654$22739EB8-D74E-441F-9561-EF2B62FDF3A1","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"355ea2d5a32b0c063f22d5437aaf9822585387f8","datavalue":{"value":"carpooling route planning","type":"string"},"datatype":"string"},"type":"statement","id":"Q6591654$11AB37BE-6157-4631-8A9E-BB28AAF7C594","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f84533d61052ed504a7168f7f0979f99a1f5dfdb","datavalue":{"value":"shortest path tour problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q6591654$12DB5895-803F-4942-BA72-EF031798EE3D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ff5b2c2856974c5ba8a84d37201646296ebf1d26","datavalue":{"value":"large-scale road network","type":"string"},"datatype":"string"},"type":"statement","id":"Q6591654$7A8AA571-3CAF-4D1B-9AED-495F053A7328","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f8c1b53a2cd12d79fc7e882ae30c91f412e12b4f","datavalue":{"value":"stage \\& global Dijkstra","type":"string"},"datatype":"string"},"type":"statement","id":"Q6591654$93A806EE-2D0D-42AF-BEA0-8D17A3A4EEC4","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":"Q6591654$378C93CA-D2AE-4F5B-9535-4F5BF9460A9A","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"fde83dc2358b044be23eaeb3226ac019d5e33e09","datavalue":{"value":{"entity-type":"item","numeric-id":5378639,"id":"Q5378639"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$1FC7480D-D828-46B3-9238-E6089B034CAA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"2c18811347a28a4ca9754e67fd7b851ffbf78636","datavalue":{"value":{"entity-type":"item","numeric-id":5636707,"id":"Q5636707"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$F9B1C1B4-1770-4187-8F47-3EE2F71DB7CC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ecd091bc5d91630b39d30891d8d70b9689650dda","datavalue":{"value":{"entity-type":"item","numeric-id":691420,"id":"Q691420"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$FC843718-965F-4F01-A75B-25A9DDCDDFEC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ef2b6c5c17fedbe67c41ca2bc8593ad58231536c","datavalue":{"value":{"entity-type":"item","numeric-id":2356016,"id":"Q2356016"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$EAD1ACDA-5D2E-4B18-9AD6-27AFB376C0AB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"2b989f45b85fa44137ad22092706b6102fd241bf","datavalue":{"value":{"entity-type":"item","numeric-id":78129,"id":"Q78129"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$3D69CE92-B1D9-4837-8587-355A5CB5AC5D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3e590f27752ee20f0001ae54a0e1d2dccd14985c","datavalue":{"value":{"entity-type":"item","numeric-id":5527519,"id":"Q5527519"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6591654$F490F298-320D-4686-A054-C11BB1763BAC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Algorithms for shortest path tour problem in large-scale road network","badges":[]}}}}}