{"entities":{"Q2768299":{"pageid":2779038,"ns":120,"title":"Item:Q2768299","lastrevid":83283548,"modified":"2026-05-07T07:03:45Z","type":"item","id":"Q2768299","labels":{"en":{"language":"en","value":"A deterministic algorithm for the cost-distance problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1699228"}},"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":"Q2768299$8DF6397E-9275-41FC-9EA0-60218A60BADB","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a69ba1e5f9160e8b9149c8202738a0a2ff875035","datavalue":{"value":"1015.90009","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768299$82AF4A57-50C8-4A41-836A-7339040F031A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9db78316c70c928b37141a9b06438b6fea0dc004","datavalue":{"value":{"entity-type":"item","numeric-id":294710,"id":"Q294710"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2768299$916F2F96-42FE-4649-89F4-D15769C062AA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1cd61dc54a904d4e6718a447d2843eceb30bc3aa","datavalue":{"value":{"entity-type":"item","numeric-id":178479,"id":"Q178479"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2768299$69CB2793-3B8D-4A31-A305-7E8659FDBBFA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a66f8b21c6eccede4355afafb3eaafe6975da626","datavalue":{"value":{"entity-type":"item","numeric-id":398847,"id":"Q398847"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2768299$87639773-B2B0-4818-B5A1-F1CA8974D79D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"bb93fa1c465ad8bc2fa283bb0b87b8516d9e8f76","datavalue":{"value":{"time":"+2003-07-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2768299$6696A249-0103-4D82-B18A-D5CC127F7816","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768299$3836DF58-0A6A-482F-8995-1C5B9B785312","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768299$A667CEE5-E9DC-41E4-A712-196A99D0A892","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768299$A274921A-7396-4E19-8C0E-2B53CF291B8C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a4228d21095b3348e9ea20aa0b63610107aad8cc","datavalue":{"value":"68W25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768299$88E78B6E-2B2C-4955-B579-4F9C77747C0F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"21aee747ca142c92e588eec744813fb6e60f098c","datavalue":{"value":"1699228","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2768299$B67E9548-DB21-4EA5-9A9A-AAD6A58FD3F2","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"692e78e23afbd64409285854af82b1bd5af876a9","datavalue":{"value":"cost-distance network design problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q2768299$C6B45E76-4390-44DA-95D9-5EDBFF185038","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4e84ee48586814a40f00ca811bc22a55bf16a558","datavalue":{"value":"undirected graph","type":"string"},"datatype":"string"},"type":"statement","id":"Q2768299$59FEDF07-D4F7-461E-B82A-502829594C84","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"468a9760790c50a8f14ee210166e4f56f71c3ca9","datavalue":{"value":"Lagrangean relaxation","type":"string"},"datatype":"string"},"type":"statement","id":"Q2768299$23A978C5-C8A1-401F-844F-B2254E35342E","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":"Q2768299$8C504041-E93F-49C3-8483-A80245B4A696","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d020581d3ca32715ced6e2349f01a263100137c7","datavalue":{"value":{"text":"A deterministic algorithm for the cost-distance problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2768299$DD4E9056-9D21-4215-BF56-E57DB92FB44D","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"522bcab30c3e7cbd71dce1a4343165d92922f89c","datavalue":{"value":{"entity-type":"item","numeric-id":3395048,"id":"Q3395048"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b0b422e4e070058d05e63cdb101485df39046034","datavalue":{"value":{"amount":"+0.8495337963104248","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":"Q2768299$9C6A6239-A6F9-4984-9534-05A4CF7BDDAC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3fd0ceb41e146d5100e74bbff67637b7c3b43ddb","datavalue":{"value":{"entity-type":"item","numeric-id":876728,"id":"Q876728"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"19409cc9fe006d1a463a4196a5b9d402fdc65ec3","datavalue":{"value":{"amount":"+0.8026559948921204","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":"Q2768299$D821459E-52A5-44CA-844F-F38D1E1E4D98","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"820beccc8e4bd549066b2bf8af76b8aa8b0a62ca","datavalue":{"value":{"entity-type":"item","numeric-id":2766688,"id":"Q2766688"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ba4c24cc0080e2c329c829c60fd0e19c90d567aa","datavalue":{"value":{"amount":"+0.7925117015838623","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":"Q2768299$5D4FAE7B-9C92-4279-BE6C-0331A40BAA9C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"10efc56d16ab396458f40e2076aae6950fa8e72f","datavalue":{"value":{"entity-type":"item","numeric-id":4517680,"id":"Q4517680"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ba4c24cc0080e2c329c829c60fd0e19c90d567aa","datavalue":{"value":{"amount":"+0.7925117015838623","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":"Q2768299$216FEE13-B152-4809-A8C7-37FEDF4791A1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"66b9ad407a875a8bae965962cb30f41626eb7ef7","datavalue":{"value":{"entity-type":"item","numeric-id":4474088,"id":"Q4474088"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2ea0afdeb4e944db3ad4de45eb8a1694816bd39b","datavalue":{"value":{"amount":"+0.7827963829040527","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":"Q2768299$E7FB9328-61DC-40B9-9F0B-6A87498BD7E4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A deterministic algorithm for the cost-distance problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_deterministic_algorithm_for_the_cost-distance_problem"}}}}}