{"entities":{"Q2861529":{"pageid":2872249,"ns":120,"title":"Item:Q2861529","lastrevid":83931689,"modified":"2026-05-07T14:34:15Z","type":"item","id":"Q2861529","labels":{"en":{"language":"en","value":"Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 6224295"}},"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":"Q2861529$9FA555D6-10C9-4B0E-A32D-393AD96CEE24","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b7f9ec17cd26ce517fdae206049d7703893aaf30","datavalue":{"value":"1274.90308","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2861529$B487299F-BE45-419F-9B2D-30FB4C18876D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"378c6af6920b6a8837a24b70d6d7a35626b3ad1e","datavalue":{"value":{"entity-type":"item","numeric-id":2861528,"id":"Q2861528"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861529$B5D31A7F-ABAF-4444-897B-1B5B2F77EB3B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7ead83b5cc1548a0f2952bb94d4dcb037860b248","datavalue":{"value":{"entity-type":"item","numeric-id":1424780,"id":"Q1424780"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861529$516EC498-0539-41BA-93A2-65F12636C91B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"bc7e2c10d34efa8cb71bc1d357709de57d889932","datavalue":{"value":{"time":"+2013-11-08T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2861529$9EA3DB29-83F0-4134-A826-598E396E4910","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"12a72e94e798d3a6c34377ed07f862848c12250d","datavalue":{"value":"http://www.sciencedirect.com/science/article/pii/S1571065310001332","type":"string"},"datatype":"url"},"type":"statement","id":"Q2861529$DDBF4480-C12A-4508-B15A-12746A85120F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2861529$742DBD90-82AC-484C-A206-86336F009DB9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8d42ae7884b9335550c4d21f090798ce9c56a9bf","datavalue":{"value":"90C59","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2861529$6885E556-A5B1-47A1-A602-FC04E734B570","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7346fa9d586bd532775f6a19d26bbfce0b6cc98f","datavalue":{"value":"6224295","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2861529$BFFDD259-DC96-4AB6-9CA4-EF7B9ACD4AAB","rank":"normal"}],"P1463":[{"mainsnak":{"snaktype":"value","property":"P1463","hash":"e7e6827c5fd59632d48d17e5c0f38766287897fd","datavalue":{"value":{"entity-type":"item","numeric-id":20565,"id":"Q20565"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861529$1C1DFCBD-4F6E-4196-97DB-0600E7573B27","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1463","hash":"4d0306a541ac4d64d413698a8167f6dce4fa4ce8","datavalue":{"value":{"entity-type":"item","numeric-id":16269,"id":"Q16269"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861529$B8961FD6-A940-46B1-B9A9-48C616E42358","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":"Q2861529$66BE6837-D407-498B-8A06-D8E09C39897F","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"3f5e03eda8b209d0eec7ecf5251efc8b2588b8d3","datavalue":{"value":{"entity-type":"item","numeric-id":4354785,"id":"Q4354785"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861529$310770E4-1131-4C7C-80EB-11B1ED8555A2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"934f4cdde1e793aafb826ac58e8ba5319d91d427","datavalue":{"value":{"entity-type":"item","numeric-id":5454363,"id":"Q5454363"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861529$B80995E9-4FC0-4311-973C-9D8728AE5177","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"dfbf9027c22c2bcae5452960e5d6e97cd6433736","datavalue":{"value":{"entity-type":"item","numeric-id":4663414,"id":"Q4663414"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2861529$F306AA2C-A9B3-4BEC-A2F7-DA326A0EB2C7","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"7be07da0dac37fa06a9984e79bdaf54e7a2bdaed","datavalue":{"value":{"text":"Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2861529$30310136-D501-4772-A9D3-AB0CF0B96071","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"2f8a5f95e3b17cab59454fd32864ddc80093d17b","datavalue":{"value":{"entity-type":"item","numeric-id":1869661,"id":"Q1869661"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c9ef5316c0f738f7c2803dce93a38a530bab0007","datavalue":{"value":{"amount":"+0.8300798535346985","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":"Q2861529$3EE40BF7-8D12-4A5C-9822-6498ED1A573E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"aba296fb435181bd6f8b09db946a32b21ee5bcb1","datavalue":{"value":{"entity-type":"item","numeric-id":3545052,"id":"Q3545052"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b36a8f1533a3afa19fd6e3aeef4bef3b82975a29","datavalue":{"value":{"amount":"+0.8087962865829468","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":"Q2861529$66CEAAA3-236C-4CC0-B690-E9A83D3850C9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"41ecb05c3f09044ca3585fdb696856ab5fd04970","datavalue":{"value":{"entity-type":"item","numeric-id":3479783,"id":"Q3479783"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"5357b84bf51983485195743fbff37a79be9e7a4e","datavalue":{"value":{"amount":"+0.8004215955734253","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":"Q2861529$919E8F87-F3F7-4A37-9DAC-C13DBE9EFF06","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"bfc0a54df1743de099e98617a38f4c41513dec82","datavalue":{"value":{"entity-type":"item","numeric-id":3545051,"id":"Q3545051"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"a40d6cb164ff6d262b624398c938097f5909474d","datavalue":{"value":{"amount":"+0.795737087726593","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":"Q2861529$90EAA585-2588-4204-B97B-F4C05AD04C70","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"0f51b5bfc2b6fd429046fa078c2d617dd0ab6f57","datavalue":{"value":{"entity-type":"item","numeric-id":2773173,"id":"Q2773173"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"04ab5c71c6b5f255679879cfb8375ecfc2198f28","datavalue":{"value":{"amount":"+0.7750594615936279","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":"Q2861529$DD99159A-AAD7-4375-A670-0A5338F1442D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Combinatorial optimization of capacity and flow assignment problem for unicast and anycast connections with linear and convex objective functions -- exact and heuristic algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Combinatorial_optimization_of_capacity_and_flow_assignment_problem_for_unicast_and_anycast_connections_with_linear_and_convex_objective_functions_--_exact_and_heuristic_algorithms"}}}}}