{"entities":{"Q4766818":{"pageid":6796398,"ns":120,"title":"Item:Q4766818","lastrevid":90787208,"modified":"2026-06-04T21:22:16Z","type":"item","id":"Q4766818","labels":{"en":{"language":"en","value":"The shortest and the K-shortest routes as assignment problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3441871"}},"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":"Q4766818$F1A4BBE0-D333-45BE-A106-C27EC56036C9","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"9842932276ecc2e38b1213971ef42b185ba53674","datavalue":{"value":{"text":"The shortest and the K-shortest routes as assignment problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4766818$AC60EF35-6384-4A80-85CC-1DDA9BAB920F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"2dbc5bfcae741aaee2cbb2269d22bfeb58040ed7","datavalue":{"value":"0281.90074","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4766818$2F4F2020-41F1-4002-80C3-36A07F139A37","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"bf7366d439122f1d1988e67edb10a716f4695ab6","datavalue":{"value":{"entity-type":"item","numeric-id":2719842,"id":"Q2719842"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4766818$47341703-A6AB-4AAA-9121-A7854FC6C174","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"0009eef2e40e65b679945693e20705f9c6245b14","datavalue":{"value":{"time":"+1973-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4766818$63640EB6-4C21-4687-A1EE-670D4D090255","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4766818$6CC20C1F-5EE6-4492-81CE-9154F0CEA847","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"699ecd5e9a6ba2cec26bd42eeb0412fba636f39c","datavalue":{"value":"3441871","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4766818$B3710944-3AFF-4FF0-99A9-A15C3DC79A02","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":"Q4766818$D072533A-2AF1-42CD-9341-C6833AE52CB5","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"d6a662c8bdcce62eb5a56324ac2686417ff3f89e","datavalue":{"value":"https://doi.org/10.1002/net.3230030105","type":"string"},"datatype":"url"},"type":"statement","id":"Q4766818$B24A39C0-F4E6-443A-B8A9-2B84FD37F180","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"d0a44c410a2795170a53d20e7c15fb90d3699b66","datavalue":{"value":"W2041809674","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4766818$5DBFACED-82A4-4B66-B2FA-D9AF8B6637BC","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"5c9bedaa529e9c70a36b61a38a15ba6f76261d10","datavalue":{"value":"10.1002/NET.3230030105","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4766818$7B3E494A-87E7-4EDB-B232-2D10E54D4F3F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The shortest and the K-shortest routes as assignment problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_shortest_and_the_K-shortest_routes_as_assignment_problems"}}}}}