{"entities":{"Q6841267":{"pageid":18426111,"ns":120,"title":"Item:Q6841267","lastrevid":74383452,"modified":"2026-04-14T20:07:51Z","type":"item","id":"Q6841267","labels":{"en":{"language":"en","value":"A polynomial-time algorithm for the probabilistic profitable tour problem on a tree"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8174878"}},"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":"Q6841267$E618B6BF-6C50-4AA3-B640-D72BF04E7123","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d7dd0fe2d1f0c37ba41d7c798701ea9ff94898a0","datavalue":{"value":{"text":"A polynomial-time algorithm for the probabilistic profitable tour problem on a tree","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6841267$0C1B3AB5-12A6-4CFF-BAD9-1CF95878033E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"fcd917f4f07665a3f50f0915178a8df333c71ff0","datavalue":{"value":"10.1287/MOOR.2022.0306","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6841267$AABC4193-680F-488A-B1F0-71E54F1BF996","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"7fd38c8352b46a9f71f6d6603d95132f898157bc","datavalue":{"value":{"entity-type":"item","numeric-id":217093,"id":"Q217093"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6841267$8CCBB551-B534-4958-9731-E60410CF9E39","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"1685b3caac3553b05071f8998664c1b260000a76","datavalue":{"value":{"entity-type":"item","numeric-id":296875,"id":"Q296875"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6841267$D4B3065E-B814-46C4-B171-1325C0F5619B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"186bb8da4d9a21e884eff28e3a0bd8547b44ac9e","datavalue":{"value":{"entity-type":"item","numeric-id":168651,"id":"Q168651"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6841267$3D9CA383-E1C8-4871-B6CD-07A9D2218C3C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"cccce4a4205b51ff587d222bc7a07ed4bfa86d8f","datavalue":{"value":{"entity-type":"item","numeric-id":103831,"id":"Q103831"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6841267$514B4600-E0F5-4737-B43F-42ADCA8EC388","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"18cefc5b01f2a823fd075bc66e852b3f0c15dac7","datavalue":{"value":{"time":"+2026-03-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6841267$EAC74B8F-28EE-45ED-A321-D06E831CA6F3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6841267$8C84C095-9DA1-43DC-9CB7-C96DB539D0AD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"aa3ca91474fff28e420d9cace433f8447ec799b0","datavalue":{"value":"90C39","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6841267$738F3C8D-D07B-498B-866C-640D0D9D8FF1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a075736dd24125fb22e78e1f01acbe15d48baf3f","datavalue":{"value":"90C60","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6841267$6A795058-F61B-4A2A-83FC-9760C777C6DE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6841267$DA477B6C-01DF-459B-8C45-EDC7C5030F96","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3ac5535156a655ce1aaad2f34448016de74e6ee9","datavalue":{"value":"8174878","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6841267$3F4002FF-D742-41A3-85B9-4F9B17ABFE23","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b1c268fd24d95447443446b07d7573fb5551fd37","datavalue":{"value":"traveling salesman problem with profits","type":"string"},"datatype":"string"},"type":"statement","id":"Q6841267$8EF3B212-C163-4D6D-B6CF-C5C21C83E3F6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"849d216bfc91488faa4248aa510b9c397cdcea2d","datavalue":{"value":"probabilistic profitable tour problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q6841267$9B1AD5CC-6D01-4699-943B-563D942D1BC3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d8be6c3794120e9ae59d4fa98167aec1929cd618","datavalue":{"value":"polynomial-time complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q6841267$1E0CC479-FFD4-42C5-913D-AFE17D4FA9FE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5f88b0812aa8d6194b4510b50a35a1d50d47a4b5","datavalue":{"value":"special graph structure","type":"string"},"datatype":"string"},"type":"statement","id":"Q6841267$4EB7BEAA-FFA8-455A-9CAB-64C051B1C8BB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"534805fa6153b1b3786edcd60407ef0861005e9a","datavalue":{"value":"tree","type":"string"},"datatype":"string"},"type":"statement","id":"Q6841267$2CE9A462-4739-43E6-9D78-2C317D28E9A7","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":"Q6841267$A757B2B5-BCC6-469E-8F6A-983308503B14","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A polynomial-time algorithm for the probabilistic profitable tour problem on a tree","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_polynomial-time_algorithm_for_the_probabilistic_profitable_tour_problem_on_a_tree"}}}}}