{"entities":{"Q878227":{"pageid":880075,"ns":120,"title":"Item:Q878227","lastrevid":65036046,"modified":"2026-04-11T23:53:26Z","type":"item","id":"Q878227","labels":{"en":{"language":"en","value":"A branch and bound algorithm for the minimax regret spanning arborescence"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5146239"}},"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":"Q878227$0BD221FC-CB4B-4837-ABC7-ECDCD560D765","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"75ffb671d11066316395970354dfc7e35e79248f","datavalue":{"value":{"text":"A branch and bound algorithm for the minimax regret spanning arborescence","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q878227$676E1449-DC68-4B9B-B950-4B90D8DF1910","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"16586a4986e90a8de9aa09321fc340813411612f","datavalue":{"value":"1156.90027","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q878227$C0861306-E135-47CC-9375-8A8D0AA78330","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"8c9a1d032b4dee05705e8b2f4f60118816c12892","datavalue":{"value":{"entity-type":"item","numeric-id":116038,"id":"Q116038"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q878227$D91A6287-1256-4D2F-84A7-607976937532","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"018eb3d5a1529ba4d911dfe810dafc033402deeb","datavalue":{"value":{"time":"+2007-04-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q878227$2475939C-E9AE-4041-912D-6F5E63C5ABE1","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"955a6ac68db8c67c1772255c707ed5eb1d2bad2b","datavalue":{"value":"90C57","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q878227$50EB8CCE-86A1-483F-A53D-877390CFAA26","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q878227$386A7A7D-BEF6-40A4-87BF-68C1ADEF1BEA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q878227$CC55DC1B-603D-4B19-9AB8-62CD3AA6B59D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"e564314c10fa5b362951b280af9f9f70fb290f3e","datavalue":{"value":"90C47","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q878227$46F12457-DE7C-4F6B-99DA-AAD50A3D5E99","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"58c8f9fa9a8f57bcf884ebe34e5e4a23c2883e48","datavalue":{"value":"5146239","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q878227$97248E87-B560-4D0C-AAF7-561768C539AE","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"52c1b443b4917ab3f5fc7fd2167ceda38ca66c99","datavalue":{"value":"Spanning arborescences","type":"string"},"datatype":"string"},"type":"statement","id":"Q878227$E16E23DF-0290-4C2D-8037-EDD3ACC038CD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d721cafe8649bd4148c49fafbebbed5a84a99c67","datavalue":{"value":"Robust optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q878227$8E46E6B0-A9E2-4686-A2A3-26DBFA751A0E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c07c6c1d15ea25aebbca2775612c6c15940acef","datavalue":{"value":"Branch and Bound algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q878227$1657A7C7-7110-4DA9-9293-E8CA84FD287B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"39eee6371e9ae7771e35d61efa3ce04e8af46958","datavalue":{"value":{"entity-type":"item","numeric-id":228561,"id":"Q228561"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q878227$2F13DFD6-C50C-488E-82A3-8F71821E00CD","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":"Q878227$784665A6-2D14-4F0C-BAB0-072CC03AEAEA","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"8e190075b9dc08895b1acd7e7f6911bd6aae25eb","datavalue":{"value":"https://doi.org/10.1007/s10898-006-9074-4","type":"string"},"datatype":"url"},"type":"statement","id":"Q878227$246B724F-FB53-424A-B0AF-A114A5A6FB38","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"c48ba2c3c2fea3077f2f433f9fea824eb7ec3a71","datavalue":{"value":"W1979902175","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q878227$D6D7B712-0C8B-451C-BBFA-1DA34B9AE31C","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"c1da5f82dc38c19960183241ac975653a41cfa32","datavalue":{"value":{"entity-type":"item","numeric-id":1827805,"id":"Q1827805"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q878227$3304C116-E707-4D40-8C4E-308AF31B0BD4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"96f993f935524556fbb273b42c20a1c62ccd4161","datavalue":{"value":{"entity-type":"item","numeric-id":881514,"id":"Q881514"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q878227$30254A65-6501-41BC-8FEE-FD2B050833AE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"2ab456935031c732c9df7e77ae45d7cb3ea982cb","datavalue":{"value":{"entity-type":"item","numeric-id":5537097,"id":"Q5537097"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q878227$60839A79-AA4A-4E6A-908A-E94C3A13753E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"007e3e3da358c5c2f6c0ac26a316656a1143d5d8","datavalue":{"value":{"entity-type":"item","numeric-id":4845371,"id":"Q4845371"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q878227$965147A3-091D-4F09-84E5-5EDCA3F985CF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"5ef4ed05ad79107119994782f718a3ec5f28be6c","datavalue":{"value":{"entity-type":"item","numeric-id":2503220,"id":"Q2503220"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q878227$152E242F-4997-401D-88BE-D53367123F8E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"0d3d413a1c12b533af88e5ba4b62acc6edb76a92","datavalue":{"value":{"entity-type":"item","numeric-id":706974,"id":"Q706974"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q878227$3C60AF19-12B7-474B-A85F-24D8B7454137","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"3f57f19aeff3f880b47463fb86d3bb9029927105","datavalue":{"value":{"entity-type":"item","numeric-id":5949905,"id":"Q5949905"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q878227$C442B61D-0C6D-4A15-88AF-21D78BF5FD34","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"79c6c98819125b6f28e3cefa5782fc4a3a8d95cd","datavalue":{"value":"10.1007/S10898-006-9074-4","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q878227$82E76DE1-0335-4513-9102-C91D0723F402","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c403c3c44a58f2098168993a6900833ea98be2a4","datavalue":{"value":{"entity-type":"item","numeric-id":881514,"id":"Q881514"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b0df3aedec3a470de250b5daadb00570b06df60b","datavalue":{"value":{"amount":"+0.93495911359787","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":"Q878227$6C894A98-F5A4-40D0-88E0-8CA1703BD56E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"56835cee6c547d8e071fba0af48105dd0772e21e","datavalue":{"value":{"entity-type":"item","numeric-id":4543079,"id":"Q4543079"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f78a60db656e7e04ecdba519d689dd605257e32a","datavalue":{"value":{"amount":"+0.8340421319007874","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":"Q878227$3714CA6D-1B77-4C53-A45E-675B201F13AA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c03f1520aaad47c7f3f13d4defb3140f3ebaf51e","datavalue":{"value":{"entity-type":"item","numeric-id":337033,"id":"Q337033"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"090d5c7e46d09c1466f6a4e17eb4bf3e9239ae2d","datavalue":{"value":{"amount":"+0.8250814080238342","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":"Q878227$2923162C-00CE-48DE-B7B1-114E1CBEFEDF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"35133667ab29cd55998b487f591b9636a2f4dd21","datavalue":{"value":{"entity-type":"item","numeric-id":706974,"id":"Q706974"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5d50f9d7bf363ad4e465771afd2793a8db83d3fe","datavalue":{"value":{"amount":"+0.8070266842842102","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":"Q878227$CEC0DB6F-D186-40DB-9730-73C0286AB272","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"663a9fe3be59d24b1ccd202724ecf6097e687dcc","datavalue":{"value":{"entity-type":"item","numeric-id":1827805,"id":"Q1827805"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"452e8b01ed6df65535bc19160bd8fe4927b13783","datavalue":{"value":{"amount":"+0.7780737280845642","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":"Q878227$59A94514-B6D6-478F-BFF4-2C70230D935A","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A branch and bound algorithm for the minimax regret spanning arborescence","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_branch_and_bound_algorithm_for_the_minimax_regret_spanning_arborescence"}}}}}