{"entities":{"Q801811":{"pageid":803659,"ns":120,"title":"Item:Q801811","lastrevid":64445100,"modified":"2026-04-11T19:54:55Z","type":"item","id":"Q801811","labels":{"en":{"language":"en","value":"Bivalent quadratic programming problem - A computational study"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3880438"}},"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":"Q801811$0DAAB41C-6A6C-406F-A1C8-71E5ECDBC3BD","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1843fcb078cff273a6af107704905c0d529cd72d","datavalue":{"value":{"text":"Bivalent quadratic programming problem - A computational study","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q801811$FDC43D5E-8D60-4EFD-84F9-38D7E9255C0F","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"8c292377c67f1c8da0d789998258b568de837ece","datavalue":{"value":"0552.90065","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q801811$3488EA3B-29B3-453E-AB15-2DBBC7199CD5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c5832f8876614de1887b6fff71a1066143db327e","datavalue":{"value":{"entity-type":"item","numeric-id":786129,"id":"Q786129"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q801811$B38BDB37-5596-414C-86E9-E6B6B2E34BF2","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"07c876e6223b6f7e45c6ea730b8b78c5772aad81","datavalue":{"value":{"entity-type":"item","numeric-id":260460,"id":"Q260460"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q801811$702689C5-A131-4AA7-B858-277C88196397","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2ee0f220147ae8bc749a64db56839865dbc4f127","datavalue":{"value":{"time":"+1984-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q801811$A285570D-3470-4681-8C83-42BD729B58B6","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"f8dd796c63123160baa0d0da3f0dc26e95240e2a","datavalue":{"value":"Consider the problem of minimizing a quadratic function of n zero-one variables, i.e. minimize \\(x^ tQx\\), subject to \\(x\\in B^ n_ 2\\), where Q is an \\(n\\times n\\) symmetric matrix and \\(B_ 2=\\{0,1\\}\\). A branch-and- bound algorithm is proposed. Problems which are difficult to solve by this method are identified and a heuristic algorithm for their solution is suggested. Computational experience relating to the effectiveness of the two algorithms is indicated.","type":"string"},"datatype":"string"},"type":"statement","id":"Q801811$17C1E799-CAEE-4AED-B2EC-5E2CD2341F82","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6958ea3363ca9244e0da0201efd237a8410f9a0c","datavalue":{"value":"90C09","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q801811$D24C1EEB-B1C9-4E73-87A5-CA617E54FF05","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q801811$029912F8-E1A0-44A8-8F7D-7944AA3108C0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q801811$39FC1B1B-59D8-4FAF-8E32-1B66ED1EBD3A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3feee98fb6a1a95642ba0c6a16390527874922bf","datavalue":{"value":"90C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q801811$E683DC0B-8D00-4EBB-A693-AC9AC48FC428","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"779d4b9ab08f83e79b470b6028ecba1004712952","datavalue":{"value":"3880438","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q801811$A9B563DF-68FA-41EC-8B4C-C2BF31123402","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bf54e2d199641bd16db964256732a9040fd52c2f","datavalue":{"value":"branch-and-bound algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q801811$A8D28728-5834-486C-8E0A-D8B3962A0BB7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2af51969b73542d6aab2bcded7015ec65969c29e","datavalue":{"value":"heuristic algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q801811$3FBF8097-8109-4F26-9852-712A4C54DA05","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"eef6d82b681f54b02898fc4286ed1dbb302fdb8c","datavalue":{"value":"Computational experience","type":"string"},"datatype":"string"},"type":"statement","id":"Q801811$6EB7C3AD-1BED-44D3-AD3F-AFB9F2A7687E","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"b3618ba111d740980b80faaa2bddaaf3e0fc0ac3","datavalue":{"value":{"entity-type":"item","numeric-id":1393352,"id":"Q1393352"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q801811$ACB0C099-B22D-4EB5-959D-BDAA00643D7E","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":"Q801811$CF2F2B8D-74C1-4AAE-B51D-E13803B1554F","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6bb2ac88007ac9c76b8b01ff244c99f09dd28beb","datavalue":{"value":{"entity-type":"item","numeric-id":792219,"id":"Q792219"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"22547928ee8c4849b46af2d804a1a50dfc133783","datavalue":{"value":{"amount":"+0.8998896479606628","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":"Q801811$90EBB574-007A-4731-A098-B67B124E3807","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"49dbe978b0aa3cbae3275b1283f2f67b4481c5bd","datavalue":{"value":{"entity-type":"item","numeric-id":2641083,"id":"Q2641083"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"9544db24e16a35be2d6b31b0d5191c257e574c44","datavalue":{"value":{"amount":"+0.8744405508041382","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":"Q801811$9C14C898-DBD0-47EB-AAC5-C92137B0488A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"d849f38e60a4748cacae39e58eebf585875e98c1","datavalue":{"value":{"entity-type":"item","numeric-id":3494380,"id":"Q3494380"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"2c51b1c74d8c1e831c285cf27f5e647f2bd60ce6","datavalue":{"value":{"amount":"+0.8544695973396301","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":"Q801811$3FA739F9-3F76-4CCC-844A-A7B6A4047FC7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"c5a8c16ee4627d32c3aa5bc3862b03a03bf8af1b","datavalue":{"value":{"entity-type":"item","numeric-id":3762072,"id":"Q3762072"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"8cacdba4da36762b48435a2eb5ff89449f835b6f","datavalue":{"value":{"amount":"+0.8381890654563904","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":"Q801811$EA4149C5-D39F-4719-955F-F46C6E985915","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"33f0d275bb2432db50bab523db1bb3ef62911e34","datavalue":{"value":{"entity-type":"item","numeric-id":3081839,"id":"Q3081839"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"14332d0bb3ad0c56648ce53046dd9e9e0efec2c1","datavalue":{"value":{"amount":"+0.8274142146110535","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":"Q801811$3CDAFA95-7BAE-499F-81C2-48BE58FC3A2B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Bivalent quadratic programming problem - A computational study","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Bivalent_quadratic_programming_problem_-_A_computational_study"}}}}}