{"entities":{"Q6857764":{"pageid":20643223,"ns":120,"title":"Item:Q6857764","lastrevid":75128386,"modified":"2026-04-17T23:02:18Z","type":"item","id":"Q6857764","labels":{"en":{"language":"en","value":"A semidefinite programming-based branch-and-cut algorithm for biclustering"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8159980"}},"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":"Q6857764$F330D187-C30B-4E6B-8776-7695A0C1A334","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"e551c5336262550534d0cdc6e72ddcb82aab21e2","datavalue":{"value":{"text":"A semidefinite programming-based branch-and-cut algorithm for biclustering","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6857764$EAE0B34E-CFA4-4DFE-8000-659020E8B0A6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"10ad470b642b88a9d4dceb919b14e3285af52294","datavalue":{"value":"10.1287/IJOC.2024.0683","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6857764$D12EDDD2-EC70-4986-8A2B-80092A9959A9","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e0f3eeed43fa3e17a3a64e08aaa482c320887743","datavalue":{"value":{"entity-type":"item","numeric-id":2676353,"id":"Q2676353"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6857764$FBD0E4DF-CBF0-4106-BFBA-697C0A73A2C6","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":"Q6857764$B0C7D7FA-D4C9-4C9E-9B92-2E7D049A8262","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"eec137a836d108cfb68d69e68b5fce4369572cb5","datavalue":{"value":{"time":"+2026-02-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6857764$0F35440F-6CA6-47F7-BF5B-6B1DA25C0FDC","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"30e0158d39e8dcc6ee00ca7b3ae626e5899d5903","datavalue":{"value":"90Cxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6857764$EA57FD54-E853-4E1D-9ED8-9688C5B11CC2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4a353e0a77932d7d02920a1683443ff856733b2f","datavalue":{"value":"8159980","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6857764$17CC2CCC-2362-43F8-A0FB-A14E65AB54BE","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f420e1939486764f3adb510eb78cde179389a426","datavalue":{"value":"biclustering","type":"string"},"datatype":"string"},"type":"statement","id":"Q6857764$A1B0FE07-D596-4430-9570-C8DAE6235D7F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8c0145dbb175f229104a70deaeffc1099143a20d","datavalue":{"value":"semidefinite programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q6857764$4A1BA045-322C-4550-B80B-272A982A846A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"89e0547bc5170c50b4b1aab6a2fb0a2fef9af5ca","datavalue":{"value":"branch-and-cut","type":"string"},"datatype":"string"},"type":"statement","id":"Q6857764$3E502E54-E460-4C0E-81ED-7D0AEA825274","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9c2df4be61b42c15be02a284667cc79d17284cd8","datavalue":{"value":"global optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q6857764$F8BFC8E9-0EF2-40D2-9D9D-37E46133F0CA","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":"Q6857764$2D8213C8-BFD5-49DE-8006-ED7613509CB9","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A semidefinite programming-based branch-and-cut algorithm for biclustering","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_semidefinite_programming-based_branch-and-cut_algorithm_for_biclustering"}}}}}