{"entities":{"Q7036296":{"pageid":21720660,"ns":120,"title":"Item:Q7036296","lastrevid":76841175,"modified":"2026-04-25T07:59:54Z","type":"item","id":"Q7036296","labels":{"en":{"language":"en","value":"A dual bounding framework through cost splitting for binary quadratic optimization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7975861"}},"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":"Q7036296$A525874C-D4FC-444B-8647-C82FC7D82382","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1523bd90002fbfd962a3c6e7d815eb19b2d8b8d6","datavalue":{"value":{"text":"A dual bounding framework through cost splitting for binary quadratic optimization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7036296$2F7898BA-B546-4FB5-9138-9272340C7375","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"3c30d3d49a848f5481a71c8165f59643223233e4","datavalue":{"value":"10.1287/IJOC.2021.0186","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7036296$704196AF-E568-443A-9564-5A74A44991E4","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6ce45da11d96644b87580c13a322dc0cd8675545","datavalue":{"value":{"entity-type":"item","numeric-id":7036295,"id":"Q7036295"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7036296$D281C250-8A83-4A0D-83E9-19B556D7A410","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5da07dc432840e6f04372fcda1fea33f165391bb","datavalue":{"value":{"entity-type":"item","numeric-id":323211,"id":"Q323211"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7036296$1AB3627D-6632-4861-AD9F-5399FE9589CD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"35f96c22d9e29bbc1c70d5f64051cb102ef48054","datavalue":{"value":{"entity-type":"item","numeric-id":337417,"id":"Q337417"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7036296$DF20821F-920D-448D-8448-406DFEFB3929","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"04a2132ddffe08dcdce9f3ce1038acb2f99309d9","datavalue":{"value":{"entity-type":"item","numeric-id":239560,"id":"Q239560"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7036296$90DE786D-B64B-4A3D-B3E0-B78A27485FD6","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":"Q7036296$D43D81AE-007E-4038-AED6-C3450EDD48A6","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2496244a8d73be6eb3466ad6b47d633d39ce8a01","datavalue":{"value":{"time":"+2025-01-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":"Q7036296$F519ECDE-8DCE-44A4-89F5-D685BA077ABD","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"30e0158d39e8dcc6ee00ca7b3ae626e5899d5903","datavalue":{"value":"90Cxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7036296$DB55D162-E377-4630-8E46-2EA978F7D8A2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"23bd547111dafe09467890e2271281e4ad93064b","datavalue":{"value":"7975861","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7036296$F4B78DFB-3D8D-41B8-87B9-EB16FCABCF3F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"20c6c05b0cddd9955dc6f257c8fda094f8f70e0f","datavalue":{"value":"binary quadratic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q7036296$367798C8-8E8C-4D0F-B3B9-8A8F91E87CF6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c123c988a4455db85cc065f2e06e0a8051be65dd","datavalue":{"value":"combinatorial optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q7036296$52C2ADAC-80EC-4370-8F37-BDBE02BA6AB8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e2401d939235d16408479f759cf86bb78a50fdb4","datavalue":{"value":"column generation","type":"string"},"datatype":"string"},"type":"statement","id":"Q7036296$E956DEFD-736F-477E-9E9F-B6337F354A0B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0240f11196d89b9aabb81fe63ef2cac445e5beb8","datavalue":{"value":"semi-assignment problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q7036296$C6778D2D-64D1-4A80-AE68-C3F7D93D3239","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b13af12a8b1570b8cdbced5de032ecab1df305d7","datavalue":{"value":"multiple object tracking problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q7036296$31A4C978-8A96-4A22-B502-B0C359E9F441","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":"Q7036296$767E0BE8-79F9-4527-967F-1B83411A3476","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A dual bounding framework through cost splitting for binary quadratic optimization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_dual_bounding_framework_through_cost_splitting_for_binary_quadratic_optimization"}}}}}