{"entities":{"Q581257":{"pageid":583024,"ns":120,"title":"Item:Q581257","lastrevid":62927871,"modified":"2026-04-11T09:02:11Z","type":"item","id":"Q581257","labels":{"en":{"language":"en","value":"A shortest path routing problem with resource allocation"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4018803"}},"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":"Q581257$2C12E5BE-F399-4FD4-BF2A-57C7E5902B3B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"b429064973862e7d2e93058a1d1d6a7365257965","datavalue":{"value":{"text":"A shortest path routing problem with resource allocation","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q581257$579FE49F-1000-436A-9F4E-B656E2FA689F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8776b848820c4ace3a8f747afb8131488cd1de53","datavalue":{"value":"0626.90091","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q581257$C85F051D-E54F-4835-87A9-789060013625","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"65506cae9fc9c6ffc365f2bdcdceabe1e1c2bd6c","datavalue":{"value":"10.1016/0022-247X(87)90022-9","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q581257$543F3881-B3B8-4C74-A02E-C5C1026AB05C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"2a4c66c2d440ff136201f4544d7c2be746ceae08","datavalue":{"value":{"entity-type":"item","numeric-id":581256,"id":"Q581256"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q581257$7E52FDCE-CBF1-411C-A2BC-FFD5A0379B8C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b4df45046c09f24af1c773935f33eb21ebc1ed09","datavalue":{"value":{"entity-type":"item","numeric-id":677135,"id":"Q677135"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q581257$BB50F1A3-451E-4D66-8825-313C84A7D1FE","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"c5ad7b9baf8e531c6b1ad954eb5f2899cc8fe5e5","datavalue":{"value":{"entity-type":"item","numeric-id":85344,"id":"Q85344"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q581257$E83512EE-A096-4DF2-96D6-AB7C54226601","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5ae48c61eed19d1e1e1f33f9255d5b329362d064","datavalue":{"value":{"time":"+1987-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":"Q581257$D53C07F6-234E-4CE5-8D63-BE8B230998CB","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"7486dce2e7807617a9b7ee3394edeb2cab88a5ef","datavalue":{"value":"The shortest path problem in a network is considered under the condition that the time to go from vertex i to vertex j is a function \\(t_{ij}(m)\\) of the amount n of resources used in the process. A slight modification of the well-known dynamic programming algorithm for the original shortest path problem is used to solve this problem. The authors examine also the case that allocations of zero are allowed and prove an existence and uniqueness assertion about the solution. Finally numerical examples are given.","type":"string"},"datatype":"string"},"type":"statement","id":"Q581257$162AF861-57B9-442D-B455-C21CE1F326D4","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q581257$4AB56DF2-6AFB-4206-BC5B-015614874CD2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"5a3bb76dbd41580d9287ece5137de80ddf22202f","datavalue":{"value":"05C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q581257$A692A71C-8068-4188-B22F-FCEC5F273133","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"aa3ca91474fff28e420d9cace433f8447ec799b0","datavalue":{"value":"90C39","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q581257$7F176C44-50F0-4705-8D8C-523CC6C4EE6A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d2e04580dea26988da1bcc6ff744ba117afb6dae","datavalue":{"value":"4018803","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q581257$4F10FE35-4C65-45D4-B57B-9A46C1564CBD","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e889d2167006942cc82f9b1ffa760357c586bd53","datavalue":{"value":"resource condition","type":"string"},"datatype":"string"},"type":"statement","id":"Q581257$3EB283DD-F1C9-4742-BDCD-273E4D0E7D07","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f85e9f2721221f48af2e899508349c71e3faa29f","datavalue":{"value":"shortest path","type":"string"},"datatype":"string"},"type":"statement","id":"Q581257$85BBDC81-906B-4A9B-A3A5-25FA8DAD215C","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":"Q581257$81A84C99-73AF-4AE3-9F42-CC1066C8DDC4","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"1709aae1f11ef87952d6e45b4ced7f8b00130960","datavalue":{"value":{"entity-type":"item","numeric-id":2545264,"id":"Q2545264"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q581257$4FFF9DBE-B4F9-41F6-9F19-30EF02FDB31D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"a73a4b4af8e9aa7b263d067ccac0986f6967ba5a","datavalue":{"value":{"entity-type":"item","numeric-id":4749594,"id":"Q4749594"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q581257$B85A5E26-C6C7-4BF3-9CB7-B2F660CB9E89","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"8038e26d849cded62c0ade7fa8b430fbe9bf7fc0","datavalue":{"value":{"entity-type":"item","numeric-id":2542937,"id":"Q2542937"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q581257$DC32B933-6953-45FC-9582-7026B54431C2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7544f31fbd77eb7f295e5d59ef5f17c9409aadfc","datavalue":{"value":{"entity-type":"item","numeric-id":1238704,"id":"Q1238704"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q581257$1415C206-6AF2-4C98-878A-25A0C616A1C8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"8454cf46f555471a04a8a87b02f1197971e7cb1c","datavalue":{"value":{"entity-type":"item","numeric-id":3789357,"id":"Q3789357"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q581257$FF259CC1-1E0A-4251-8A91-4DF888C727B3","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1fe89ff0fb299db27631a006ed07583c4416b4b3","datavalue":{"value":{"entity-type":"item","numeric-id":3827808,"id":"Q3827808"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6f06b419a78fad6b61a8388f0d10d7eb0216d3cc","datavalue":{"value":{"amount":"+0.8538062572479248","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":"Q581257$AE379998-75C3-4410-AA20-E11C872BA5BD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d53116179ea7b61d1e4b66a218e3a98cf4b0b481","datavalue":{"value":{"entity-type":"item","numeric-id":1898544,"id":"Q1898544"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"edb3f8719f7bf1e7b8b6b9063709eb91fbfd0c62","datavalue":{"value":{"amount":"+0.8235527873039246","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":"Q581257$FC533A58-0513-450A-BFF0-C8F53E3AFE20","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7bf03cc5df93575f0f683d6bddbf7de8b0c5f2cd","datavalue":{"value":{"entity-type":"item","numeric-id":5558804,"id":"Q5558804"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"de1688a2846f3dc825402fac0012139f22c6e350","datavalue":{"value":{"amount":"+0.8015335202217102","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":"Q581257$045E6191-2EE9-41EE-BEEB-E0FE665A507F","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":"6ad618402d6558a091232c365e99dcbcdb756346","datavalue":{"value":{"amount":"+0.7939112186431885","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":"Q581257$F3E3DB03-8586-460C-AB01-BB625B743928","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6e1611a68dd82cdb976d12fb2f752b5b1feb9cc5","datavalue":{"value":{"entity-type":"item","numeric-id":4375808,"id":"Q4375808"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5a5364d1cdc567e4e73c24ee307a65e3a8f1e082","datavalue":{"value":{"amount":"+0.7909987568855286","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":"Q581257$09CD1E9E-B8DE-494E-AF91-CAD4B1BCA5EA","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A shortest path routing problem with resource allocation","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_shortest_path_routing_problem_with_resource_allocation"}}}}}