{"entities":{"Q6908183":{"pageid":20948962,"ns":120,"title":"Item:Q6908183","lastrevid":75592156,"modified":"2026-04-19T14:07:43Z","type":"item","id":"Q6908183","labels":{"en":{"language":"en","value":"Branch-and-Benders-cut algorithm for the weighted coflow completion time minimization problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8113810"}},"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":"Q6908183$F10C0F36-7519-41F6-BFF0-D4DB719929C8","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"cc37ee39ece622e8577181aaf8480db4afecf8a6","datavalue":{"value":{"text":"Branch-and-Benders-cut algorithm for the weighted coflow completion time minimization problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6908183$4537711A-98EA-445B-BF58-B5058831EC67","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3f8179e8aa4e5d2dd3a8e9348380a615a061539c","datavalue":{"value":"10.48786/INOC.2022.14","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6908183$E5D94211-1CA6-4B77-B467-857EF8FAD28D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ab6adc0442d85dcf1f206803420d7eb237dc22cd","datavalue":{"value":{"entity-type":"item","numeric-id":1661867,"id":"Q1661867"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6908183$C92101AF-D152-4BCD-9644-AD277B48982F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"29d9cd263b4ec392fa6d04fe86f3819c0e692e1a","datavalue":{"value":{"entity-type":"item","numeric-id":418002,"id":"Q418002"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6908183$1271AAA7-2829-43B6-B905-DFE82BA95321","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"e86b50e5e195b95ede02176f93515734fa432b1d","datavalue":{"value":{"entity-type":"item","numeric-id":878726,"id":"Q878726"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6908183$5F0EDCB7-8F83-4D5A-8E12-2551A7448A31","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"742d43c92fbebe8231065e14eba885bf5ce7dbac","datavalue":{"value":{"entity-type":"item","numeric-id":969015,"id":"Q969015"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6908183$509B07C7-F82E-4E35-BF6E-9A5B76D6CF90","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"eca6498c2093e278286d935891c9b475b2f085cd","datavalue":{"value":{"entity-type":"item","numeric-id":935203,"id":"Q935203"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6908183$BF317487-6641-468A-9041-54B2D1A6488F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"8bbf5cb914fc890006b4df819fd233f1fc70a403","datavalue":{"value":{"entity-type":"item","numeric-id":4630378,"id":"Q4630378"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6908183$29E5F6CC-7A9A-4161-BCDC-62108769E844","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"8ea0c39ebba000a128da439df89575fe27604f52","datavalue":{"value":{"time":"+2025-10-31T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6908183$A162B15D-C337-4C86-A362-1F9877D33715","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6908183$A1F3A15B-D9E5-4818-B58C-96982BBD7651","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"bf44f3ad3a2f88c9b2a45e4395030d611f0589bf","datavalue":{"value":"90C11","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6908183$E6A20618-7739-41D2-AA3F-F3662270A163","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"41cd3229e75647392b51559c9f528d3f9eedf3cb","datavalue":{"value":"8113810","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6908183$86849D6E-0F47-4B82-9B7D-573ACB296379","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":"Q6908183$9406F3E5-490B-464C-9C57-8E84B5998CC8","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Branch-and-Benders-cut algorithm for the weighted coflow completion time minimization problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Branch-and-Benders-cut_algorithm_for_the_weighted_coflow_completion_time_minimization_problem"}}}}}