{"entities":{"Q792219":{"pageid":794067,"ns":120,"title":"Item:Q792219","lastrevid":64414188,"modified":"2026-04-11T19:42:53Z","type":"item","id":"Q792219","labels":{"en":{"language":"en","value":"Unconstrained quadratic bivalent programming problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3852792"}},"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":"Q792219$BFA74DDA-8FCE-4148-A91E-0EFD1D9FA337","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"bc89a48cd9d3fc1d8ad5de0cfe44f99d66cf5e6d","datavalue":{"value":{"text":"Unconstrained quadratic bivalent programming problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q792219$6961A717-86BB-43C5-9F3B-BC59DB033C53","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"4cfa3c87cb1c90ea0ab922c2979f50dc0029e94f","datavalue":{"value":"0536.90063","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q792219$D77D7BDA-50F5-4499-9D1E-228833A76FF3","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"233434212243c352e629e333b11f28c1f8ebbaff","datavalue":{"value":"10.1016/0377-2217(84)90055-9","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q792219$CC2E20F0-75D8-4FA1-9AAB-3E875AC767B6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"44a71fc05a9930c03a37ca2a4c15d33c1ceba6ed","datavalue":{"value":{"entity-type":"item","numeric-id":792217,"id":"Q792217"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$515294C2-EF92-4D9B-9EF4-7BA3A50DE7AE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3cafcd604aa5a58f9578b2ea045ac63c0c47fe68","datavalue":{"value":{"entity-type":"item","numeric-id":167967,"id":"Q167967"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$EDFD02FF-4837-4989-BA63-05D3BE7879B5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5594d53f1fd47813048cc387b38abeaa5932c421","datavalue":{"value":{"entity-type":"item","numeric-id":718379,"id":"Q718379"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$D9EDE530-8BA7-43DA-ADD0-4412CD488E2C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"38576f39a6df37711cb397d1408ced7e3814cc6e","datavalue":{"value":{"entity-type":"item","numeric-id":62319,"id":"Q62319"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$BA28D679-9229-437C-9013-702D8333A052","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":"Q792219$6B547E04-37EE-45A8-9AFA-DECDB5CDE3E1","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"081630eca9bfbded5e1379e17a6a9fe3072663cb","datavalue":{"value":"The problem of minimising an unconstrained quadratic function of 0-1 variables is considered in this paper. A local minimising point is defined; and necessary and sufficient conditions for such a point are identified. A branching and pruning algorithm, which essentially generates all the local minimising points, is proposed to solve the problem. Computational experience with the algorithm, which is encouraging, is reported. This experience indicates that problems up to 120 variables are solved efficiently by the algorithm.    Another computational study, incorporating some efficient bounding strategies, has also been conducted (to be published in Opsearch). This study is aimed to identify the relatively difficult problems and has also been used to propose efficient heuristic algorithms to solve these difficult problems.","type":"string"},"datatype":"string"},"type":"statement","id":"Q792219$A66C303C-58AA-4589-8859-6AC417A8023F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6958ea3363ca9244e0da0201efd237a8410f9a0c","datavalue":{"value":"90C09","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q792219$BE80C875-8AC7-430F-9CA0-B562891A3F3E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q792219$D0B661CC-EDF8-4B18-998D-745ACA78075E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q792219$C0BAD68A-20D6-43D4-86A8-DAFFE45901A6","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c5461f3a71e9ceed556cfec51dd6d2c8e34b60b9","datavalue":{"value":"3852792","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q792219$C480E101-98DF-478B-B963-8DDD5532E62F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0b7f6ba0ee3d9a2b3fc09334281d2c1f24617bb0","datavalue":{"value":"unconstrained quadratic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q792219$DC9C7F4C-CDC8-430D-A95A-F517B4F54F0C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f2547fe05fc38d862a3c0fa5dd3d72d33319bce3","datavalue":{"value":"computational experience","type":"string"},"datatype":"string"},"type":"statement","id":"Q792219$8F6A374B-C1A0-4A12-A54F-D449F283952C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"acea583444477d828659db7f373b180e222b47ed","datavalue":{"value":"branching and pruning algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q792219$FFE0822A-19F2-4431-BF8F-56C29A23E1F9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a40f41512f25792abb4d235b5d41721a5bad9958","datavalue":{"value":"efficient bounding strategies","type":"string"},"datatype":"string"},"type":"statement","id":"Q792219$266A4189-62F8-4D42-990C-C0393D35F419","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":"Q792219$353E3824-D709-4990-AA90-7A0B80491573","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"a68bb2266475c6f0e8e9ebcb7490465bdea6c216","datavalue":{"value":"https://doi.org/10.1016/0377-2217(84)90055-9","type":"string"},"datatype":"url"},"type":"statement","id":"Q792219$6188ED43-A1F6-4FBB-952B-A7F0AFE60B1C","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"f472eb70c63d99d1e883804b1887a03e0c782169","datavalue":{"value":"W2002507586","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q792219$8A84B00B-9FCA-41C9-B8DC-770C8BB308CE","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"81738ef4dc913499bf4e81070a1ea9ab3ec63e17","datavalue":{"value":{"entity-type":"item","numeric-id":3912370,"id":"Q3912370"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$5AC38718-0DCB-40A8-A5ED-B688218E5009","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"66c96e72b71cedff0093f937765eba8e301b5a9e","datavalue":{"value":{"entity-type":"item","numeric-id":792219,"id":"Q792219"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$2C8327CA-3029-4E8B-9589-F8472A516E77","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"c2ec5477ed81b4bd9beebf6ad8b16c4546d8f0c7","datavalue":{"value":{"entity-type":"item","numeric-id":5538300,"id":"Q5538300"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$1F80B189-B0DB-4007-ACCB-5C8DF0240266","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"1c5647671ed9c960d7ab332e3f46866722db2c88","datavalue":{"value":{"entity-type":"item","numeric-id":5678664,"id":"Q5678664"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$220E802A-B259-43E8-91B9-CC20886DB921","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"38f727004fd613b4697ed1547e5fd1c544001bf8","datavalue":{"value":{"entity-type":"item","numeric-id":4060732,"id":"Q4060732"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$385821A5-DBCC-40C3-9980-74E04D121E24","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"5837b0a383f5c794f24d0437d5243d20a1f9fc1d","datavalue":{"value":{"entity-type":"item","numeric-id":3048590,"id":"Q3048590"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$2113B7EE-BDA2-411D-A71E-E5D7543FE701","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"27d261e8d5ff9972528e5bd019649afdf9e9cdce","datavalue":{"value":{"entity-type":"item","numeric-id":5588323,"id":"Q5588323"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$DCEA76A5-1CAF-490C-9E7A-75C3F8E7B2DF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"e1a89411279a353372211802e75f51489a21d592","datavalue":{"value":{"entity-type":"item","numeric-id":5679925,"id":"Q5679925"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$FAAB5C69-7067-4486-A3CE-9596BCD0C1D1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"eb1971476988dd1583d8582c2332379ed61a85fd","datavalue":{"value":{"entity-type":"item","numeric-id":4090127,"id":"Q4090127"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$7B690F5D-3B66-4718-B5DC-E0C04B157BA9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"4e0cc1901b8a0e1db98ec58431f6024916a5d87d","datavalue":{"value":{"entity-type":"item","numeric-id":5645536,"id":"Q5645536"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$1BAD2648-1752-4DF8-B923-D2C13D43CF05","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d5d2ff8ca55c71a00eb97ded234e95c181b7889c","datavalue":{"value":{"entity-type":"item","numeric-id":5603745,"id":"Q5603745"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$33FF25FE-6A1F-49BD-A774-CE850634FB69","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f3a8411fbbf3366fda3458e8e2308f8e6c703e28","datavalue":{"value":{"entity-type":"item","numeric-id":2265338,"id":"Q2265338"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$4EB04A3A-985D-44AE-8AD3-12BB97C0F3FE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"d24bef453c8998951dabf287f3db19d4c1339c41","datavalue":{"value":{"entity-type":"item","numeric-id":4058826,"id":"Q4058826"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q792219$543A5719-2DFD-4B1C-A412-15ED723AFF91","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"8d79cac08eb6ee61668f44e2fb81b88c9725ccda","datavalue":{"value":{"entity-type":"item","numeric-id":801811,"id":"Q801811"},"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":"Q792219$44C15E4C-B1BF-4246-8213-83E82B302411","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":"abc3f787f9081dbb070150baad8a7934f85b41b8","datavalue":{"value":{"amount":"+0.8353404998779297","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":"Q792219$31B3EDF3-A179-456B-8F3C-11A25F6BF3E8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fa2654366751f55140f2c3946c785fd71f805ce0","datavalue":{"value":{"entity-type":"item","numeric-id":1893147,"id":"Q1893147"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"de94d12089fae7ff48fb70bc634482c483f62b0e","datavalue":{"value":{"amount":"+0.826866626739502","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":"Q792219$FBC5129D-4D74-45AD-8B89-001A30E06608","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"30ab3d825df9298a9fe4474ccd65cd76e3114004","datavalue":{"value":{"entity-type":"item","numeric-id":1123806,"id":"Q1123806"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"ec6f5bec391df75b7b22f0c717c806362b00d5d1","datavalue":{"value":{"amount":"+0.8180758953094482","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":"Q792219$8BEF8FC5-ACB8-4F1F-961E-A45EDFC2F41F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"7b90434f5ebcbe3f1c831141c973b5ae528d31e4","datavalue":{"value":{"entity-type":"item","numeric-id":4371734,"id":"Q4371734"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"0ea610ae6b35fd14e60036baf53aa74b6f53df76","datavalue":{"value":{"amount":"+0.8168796300888062","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":"Q792219$67CA87C0-2EC0-418D-B18B-4B0C0122599D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Unconstrained quadratic bivalent programming problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Unconstrained_quadratic_bivalent_programming_problem"}}}}}