{"entities":{"Q2861513":{"pageid":2872233,"ns":120,"title":"Item:Q2861513","lastrevid":83822792,"modified":"2026-05-07T12:06:47Z","type":"item","id":"Q2861513","labels":{"en":{"language":"en","value":"An improving dynamic programming algorithm to solve the shortest path problem with time windows"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6224281"}},"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":"Q2861513$AD00F94F-CAD5-4174-A83B-A9A7DFB489B0","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"14d36c6d85cd9859a75a6e4d33458fcb69f03e89","datavalue":{"value":"1274.90324","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2861513$5ABFF701-C637-4428-B672-B228673CF558","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"11f6caf5ebfa8ff3068d0404a085102cd26f7fe1","datavalue":{"value":{"entity-type":"item","numeric-id":989833,"id":"Q989833"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861513$0C2CA946-0094-461A-8635-2E2AD7E6329F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d81e83666cb827e12a22c6385153dc3c42bd550f","datavalue":{"value":{"entity-type":"item","numeric-id":338863,"id":"Q338863"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861513$E55161AE-2318-4BA4-A0F1-037C723649A0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ba8d34c5b417455e026432f8415dd42feb662e18","datavalue":{"value":{"entity-type":"item","numeric-id":817196,"id":"Q817196"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861513$F2C1E167-4B59-4F5F-B5EE-9EBA7B7826DF","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"bc7e2c10d34efa8cb71bc1d357709de57d889932","datavalue":{"value":{"time":"+2013-11-08T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2861513$79E27560-9D3E-42E2-8453-D89CCAB72F1C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"3110f6befd43f903e36e0e2095994be7071fe23c","datavalue":{"value":"http://www.sciencedirect.com/science/article/pii/S1571065310001198","type":"string"},"datatype":"url"},"type":"statement","id":"Q2861513$89FC6775-7349-43B1-AE33-B49BF040C76C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2861513$C5FB7094-F171-4C45-8F37-D9C56E315343","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2861513$381551D3-4388-49F7-85A8-F6D2D26671A7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"aa3ca91474fff28e420d9cace433f8447ec799b0","datavalue":{"value":"90C39","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2861513$F9097B7A-1064-449D-998C-9276159E8999","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"095a227ae0c7bc86cfcfaa1c979d2b97475d992f","datavalue":{"value":"6224281","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2861513$83FA87E9-36FB-49A7-9DAA-CC180EB0E894","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":"Q2861513$9ACCAA6F-9A55-40B0-8892-6607382C6C07","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"6a860092cae4ad4c5ee631c0a98f0a7ee7f9c9d0","datavalue":{"value":{"entity-type":"item","numeric-id":3241581,"id":"Q3241581"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861513$2C09D7D8-61CC-481D-A509-482BD2B48A68","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"0a6a64f2698b54932ee15d3f398086c4363e99f7","datavalue":{"value":{"entity-type":"item","numeric-id":1123818,"id":"Q1123818"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861513$AC541EAE-F65D-4249-A0C3-D4D68F0D9019","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"235109d230042f5413d0bfa0cddd3bef647a4f00","datavalue":{"value":{"entity-type":"item","numeric-id":3798494,"id":"Q3798494"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861513$43101497-9C9F-4C44-95E7-2FAE5F2E08FF","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"05aefbdb98f4f752a6c6ca8b037212a323bd5276","datavalue":{"value":{"text":"An improving dynamic programming algorithm to solve the shortest path problem with time windows","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2861513$D060142E-2581-499F-AC13-B565F9B165B8","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"9d0a42095d25572f772eab9e07809f6d25019af5","datavalue":{"value":{"entity-type":"item","numeric-id":4540047,"id":"Q4540047"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c73a9e179346e31d6266d2c43a24beecd4822c1a","datavalue":{"value":{"amount":"+0.842340886592865","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2861513$2F82BAAF-A1DE-4669-908E-D31C6588AFEB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"de0d98bcbf3e586a193c867f9e0d49a0849e80d2","datavalue":{"value":{"entity-type":"item","numeric-id":4395334,"id":"Q4395334"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a03da6ca3a544e84fa23d61f606b25fe2c35217a","datavalue":{"value":{"amount":"+0.8145825266838074","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2861513$93EEE115-14AE-4D13-AF0F-FAD181C2DA05","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"757a99c397b6e5a2a61710f0ab8efc9062a6f811","datavalue":{"value":{"entity-type":"item","numeric-id":2282521,"id":"Q2282521"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"65702a15a4e5da729747f0f4bf2e4acc5abbc257","datavalue":{"value":{"amount":"+0.8138253092765808","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2861513$1EC211BE-95EF-4191-99DB-FB440878C9AD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6d43e7feb3688231c4a36dae6883baba21ba9b0a","datavalue":{"value":{"entity-type":"item","numeric-id":3798494,"id":"Q3798494"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"51010cf565f148acc334e67364668316521117aa","datavalue":{"value":{"amount":"+0.7989405989646912","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2861513$A883B66E-939B-4AB3-B76F-6F9940DF182E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"90d39c3aba2bb3f8f0e53a4befc447985799a1cd","datavalue":{"value":{"entity-type":"item","numeric-id":3442459,"id":"Q3442459"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ec0846a383a8f1028ab80b9a5dc751941a5878f3","datavalue":{"value":{"amount":"+0.7857625484466553","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2861513$5F886AB5-EC7A-475C-B054-33132ED10AA3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An improving dynamic programming algorithm to solve the shortest path problem with time windows","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_improving_dynamic_programming_algorithm_to_solve_the_shortest_path_problem_with_time_windows"}}}}}