{"entities":{"Q4347283":{"pageid":6376882,"ns":120,"title":"Item:Q4347283","lastrevid":96670880,"modified":"2026-06-05T11:58:37Z","type":"item","id":"Q4347283","labels":{"en":{"language":"en","value":"A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1045608"}},"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":"Q4347283$D3F61075-6B7A-4B15-9E2F-82389F723FB1","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"4e36731779c59bb95c1db7a14ac3f51048863e6a","datavalue":{"value":"0874.68243","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4347283$CDDB8522-A9D4-4BA3-A98B-5DAC81D0C0E0","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"228b8ae7974fdcec7979d4300b6f1065be90f2e1","datavalue":{"value":{"entity-type":"item","numeric-id":241142,"id":"Q241142"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4347283$DB9C7A2F-670E-4249-A894-91AF29624502","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"c1b1daef8f6648b31bd9c365da99db923f5676ee","datavalue":{"value":{"entity-type":"item","numeric-id":203166,"id":"Q203166"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4347283$7D9E166C-792B-4CAC-AEF6-8299C468C2E5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9bb4124699c1f5367e8eff90a7046d28f42f9fac","datavalue":{"value":{"entity-type":"item","numeric-id":203167,"id":"Q203167"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4347283$FEDBB842-DF42-49AE-AE9A-33E01A7B1F02","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"06599f7b06ffd0dab7d01f4fa58a94c35371f955","datavalue":{"value":{"entity-type":"item","numeric-id":702708,"id":"Q702708"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4347283$7BF763DA-3664-4BA1-98AE-B682D4BCAD7F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"32804be4b8111f081e99352fa26bfb48470f437b","datavalue":{"value":{"time":"+1997-09-18T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q4347283$C450DC2D-1458-4EDD-A629-A33AF7BC7550","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4347283$17033495-841F-423F-B5D5-51DF9614DDAD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d5da87a72c21717089feda882f568938059a9d84","datavalue":{"value":"05C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4347283$CCD2A06C-142D-4F3B-9579-BC4AF797970B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"56c6161891f8c0ccc1bc9dfc76231cf56194dd44","datavalue":{"value":"1045608","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4347283$688EFF5B-6B92-4781-B72E-FEABF1134285","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4902176e66ac38897a47eabd0ed1a5e768514b7e","datavalue":{"value":"capacitated shortest spanning tree problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q4347283$7F351EE0-554A-4562-B325-785E1CA56148","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":"Q4347283$83526600-6723-434A-B37A-7415A26EF678","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"3b23f9c8bc9959f509f68ba235eafe64e672d8ef","datavalue":{"value":"W2006935476","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4347283$61C6887E-E4B6-41E4-8398-753D8E714697","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1ba3d8df67759459bab5c1a2a5e24820dd8fef68","datavalue":{"value":{"text":"A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4347283$2668F53A-6195-468D-B15B-4746A1EF3A47","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f55ab0b2c855baaece71aa218a9bde74f9e473f2","datavalue":{"value":"10.1002/(SICI)1097-0037(199705)29:3%3C161::AID-NET4%3E3.0.CO;2-F","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4347283$0CA00926-2035-4AF9-BF55-4D7367474181","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"0c3324aeadf27e3975f733d334c43b7794713c6c","datavalue":{"value":"https://doi.org/10.1002/(sici)1097-0037(199705)29:3%3C161::aid-net4%3E3.0.co;2-f","type":"string"},"datatype":"url"},"type":"statement","id":"Q4347283$A42ADDF3-CBCC-4FC0-A70D-C5C411A63305","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8ecbd7f6a1a285147faf31e75fe09e3a1f7f8df1","datavalue":{"value":{"entity-type":"item","numeric-id":933503,"id":"Q933503"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ed103df3721c7334312d342bb31187686866f806","datavalue":{"value":{"amount":"+0.8226935863494873","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":"Q4347283$054D6D05-833C-41F8-89AF-854945F172F9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"e79041159c08d688373e610029797ee4317df805","datavalue":{"value":{"entity-type":"item","numeric-id":4813065,"id":"Q4813065"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"945e4a749cda3f7c9a4b964380b8533712a90ffc","datavalue":{"value":{"amount":"+0.8161357045173645","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":"Q4347283$513D8A65-5FB9-40E7-B73C-94356F73FD7B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ef8c2db0cbd23913124ab6d91cc684e7fd7c5869","datavalue":{"value":{"entity-type":"item","numeric-id":1811625,"id":"Q1811625"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2e6f9e60246d12a3a2e7a2bdab00aae02255b767","datavalue":{"value":{"amount":"+0.8132035136222839","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":"Q4347283$5BE98F9C-CB69-4087-B886-B3A94D093A00","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"cfc6d899871936857616a5ed7372c21d9b2d73cd","datavalue":{"value":{"entity-type":"item","numeric-id":4656658,"id":"Q4656658"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5237a33be7b687ae25f12aa4225dfea9813b3edc","datavalue":{"value":{"amount":"+0.8083450794219971","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":"Q4347283$BB0818C2-EF1A-4C88-A0E0-9AA078044E0E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"23966774886d4aa608a55755ca716888c3380e8e","datavalue":{"value":{"entity-type":"item","numeric-id":447690,"id":"Q447690"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0d29d5a9c37af8505a61fef2e38a673abc594bfe","datavalue":{"value":{"amount":"+0.806578516960144","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":"Q4347283$44D61C4C-5367-4F19-8355-345CA660C20C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_tabu_search_algorithm_for_the_Capacitated_Shortest_Spanning_Tree_Problem"}}}}}