{"entities":{"Q2899024":{"pageid":2909749,"ns":120,"title":"Item:Q2899024","lastrevid":84940349,"modified":"2026-06-03T05:15:23Z","type":"item","id":"Q2899024","labels":{"en":{"language":"en","value":"An encoding in metaheuristics for the minimum communication spanning tree problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6060448"}},"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":"Q2899024$457D6500-6B20-405B-8B02-525A1D6FCE29","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"055051dcddd6a8ce0f2b4d3d3e565a22540da745","datavalue":{"value":"1243.90038","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2899024$7EA18719-F347-432A-A638-C13C50BD53A9","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f030fff290cba9104f71fb1447bb02747b898e5f","datavalue":{"value":{"entity-type":"item","numeric-id":74741,"id":"Q74741"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2899024$CBEFAF9B-02F4-4129-871F-B27040154C89","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1354d94d5c7fee481a21b3b2cba3ea61fdeb44f1","datavalue":{"value":{"time":"+2012-07-28T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2899024$F7046588-61F1-4141-9889-F5D1AD27521D","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"e9b7da3ee0bea48d8a33a1bcc640aa724b2ada8f","datavalue":{"value":"https://semanticscholar.org/paper/3d167ed1b2bef904ca8902439e14b49202425a13","type":"string"},"datatype":"url"},"type":"statement","id":"Q2899024$FF8562F3-926C-4C87-8D51-7BFC3A948115","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e3ec0ebb66ad9a53653ec1e19a7608e786acef46","datavalue":{"value":"90B18","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2899024$A7EA86DD-EE48-423E-8BB7-26574867D917","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"99e75c38935b147cca2a0eac1e86993c645e76a5","datavalue":{"value":"94A05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2899024$26B131AD-3D12-466F-BEF3-7E32381D6099","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8d42ae7884b9335550c4d21f090798ce9c56a9bf","datavalue":{"value":"90C59","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2899024$D28B73E5-2550-479A-A780-4343D1DC06D6","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"148e0b122e2e0021b70e500e2e490f485feb4a46","datavalue":{"value":"6060448","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2899024$BD872AAF-0260-4295-A949-81D75681BDCB","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"66462a9baefcadb7d3983166f935c137629a695f","datavalue":{"value":"problem-specific representations trees metaheuristics encodings communication networks","type":"string"},"datatype":"string"},"type":"statement","id":"Q2899024$AE6B1A3F-429E-4526-B621-A1D5F47FA001","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":"Q2899024$46203F3F-4EB0-4E6D-A6D3-495F90113D97","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"edd23de5b77265363f7c81ce7ce2f0d3349d53d1","datavalue":{"value":"W2139151433","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2899024$77CE77FB-A87C-4CA2-8EC6-435146F3992A","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"55a139b1d5450d5b5c54c8154e8d4d875ed40ba0","datavalue":{"value":"Q58205460","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2899024$237DD2AB-1094-4FDD-B475-0C1E0E074BA7","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f7fbe8af1310bb1c6a640766a4940954f4602e3f","datavalue":{"value":"10.1287/IJOC.1080.0310","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2899024$2D71FC3B-3983-4024-B6F7-273D50F0979B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"27e5072d61cf6e520453e62e9e6d3d0f31988e1d","datavalue":{"value":{"text":"An encoding in metaheuristics for the minimum communication spanning tree problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2899024$BD61C340-318F-477D-8B7B-EB63E4C765A6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0659a2c9e645b36fcf7b57462f802835a74c337c","datavalue":{"value":{"entity-type":"item","numeric-id":6770269,"id":"Q6770269"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2899024$1DC09080-B8E7-4C2C-8688-9AE54113BED4","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3f1faea5892c68408a42611fd553317f044a6a7d","datavalue":{"value":{"entity-type":"item","numeric-id":2770479,"id":"Q2770479"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6cb90c3f2c71de61131708d11d03a1cebdf9a995","datavalue":{"value":{"amount":"+0.7706193327903748","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":"Q2899024$EAB8EB61-07F0-40AB-9908-F7989E7DF972","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"23e5c748b16b8f778eef8f336eeb5c91e1843746","datavalue":{"value":{"entity-type":"item","numeric-id":3065872,"id":"Q3065872"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4ea4b1f124c20fca74178fd12a5472b1139ec772","datavalue":{"value":{"amount":"+0.7559908032417297","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":"Q2899024$8C4EAEFE-2BB0-4666-B249-0FADE3F72A39","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"38b73bbbdcb82b7253a4d173a06d265a622d848b","datavalue":{"value":{"entity-type":"item","numeric-id":2717900,"id":"Q2717900"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"66b7c3575d166f055888f1ee67b0842df8aa3ab7","datavalue":{"value":{"amount":"+0.7393730878829956","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":"Q2899024$F20CB68B-FE42-41FE-8C6F-F59B7D636A24","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"9415d53b6dad77e6c8ae3d03417623ccb4b939e3","datavalue":{"value":{"entity-type":"item","numeric-id":337493,"id":"Q337493"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"66b7c3575d166f055888f1ee67b0842df8aa3ab7","datavalue":{"value":{"amount":"+0.7393730878829956","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":"Q2899024$0D05D19C-CBC9-460D-AB41-D969FC7EC271","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"1a5b40cc6e7a7b1885f28b9fa82779cca25c93ed","datavalue":{"value":{"entity-type":"item","numeric-id":2722092,"id":"Q2722092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8c74720917f9b79ee4cabe4a6f6b3d972dcf19b3","datavalue":{"value":{"amount":"+0.7353186011314392","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":"Q2899024$EF23746F-28FF-443E-A5F7-F8E17BB220FC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An encoding in metaheuristics for the minimum communication spanning tree problem","badges":[]}}}}}