{"entities":{"Q2505314":{"pageid":2516057,"ns":120,"title":"Item:Q2505314","lastrevid":78884627,"modified":"2026-05-06T12:39:35Z","type":"item","id":"Q2505314","labels":{"en":{"language":"en","value":"Using the unconstrained quadratic program to model and solve Max 2-SAT problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5060015"}},"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":"Q2505314$98CBDEA3-8AC5-4B66-A961-20CB562D2F12","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"4e32b2f28e856ae3bca8516084dcce5bf56235f2","datavalue":{"value":{"text":"Using the unconstrained quadratic program to model and solve Max 2-SAT problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2505314$1C192777-3797-45AC-935C-377D37E61643","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"f952fd8f8cebeadcad68c13ce3c8acb474322d53","datavalue":{"value":"1100.90059","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2505314$DD34D808-E797-4A34-9704-8520C90192E6","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"27250f49d9c3d87280064d228a43b748b71314df","datavalue":{"value":{"entity-type":"item","numeric-id":206978,"id":"Q206978"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2505314$5A368BDE-0C49-4C1D-A580-EBBBBBC4A846","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2bba0dc06d9e863feee266304b6624ac54f793c4","datavalue":{"value":{"entity-type":"item","numeric-id":168083,"id":"Q168083"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2505314$F41AE74A-329C-4E1C-8796-4309B652D659","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"25a31c3bf449a0a732cf6af429b43d73c808e64e","datavalue":{"value":{"entity-type":"item","numeric-id":206977,"id":"Q206977"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2505314$DDE9A263-D8E9-41BE-AB32-B5B18BFDB4C6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f3a10ffa912a5048ab7760a2aa04a3bfb33fa293","datavalue":{"value":{"entity-type":"item","numeric-id":843385,"id":"Q843385"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2505314$4D1565C5-1700-4C11-BA36-23A86DD92ED1","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"2416e8a5c76a3e001f6e57b132d70eaeca49c502","datavalue":{"value":{"entity-type":"item","numeric-id":541285,"id":"Q541285"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2505314$5EB580D6-6125-4068-9C76-04657DC64CB2","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9022dfc459f559856a162bb29019f955ec43ea2e","datavalue":{"value":{"time":"+2006-10-04T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2505314$6C4440F2-1549-4E37-9F01-1264472DDA22","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"8e5046eb7425ddbec5a798c3baf687c5444c2b01","datavalue":{"value":"Summary: Satisfiability (SAT) and Max-SAT problems have been the object of considerable research effort over the past few decades. They remain a very important research area today due to their computational challenge and application importance. In this paper, we investigate the use of penalty functions to recast SAT problems into the modelling framework offered by the unconstrained quadratic binary program. Computational experience is presented, illustrating how promising this approach is for Max 2-Sat problems.","type":"string"},"datatype":"string"},"type":"statement","id":"Q2505314$A3ACED1D-6CE1-4700-99F4-254D757CC22E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"8d42ae7884b9335550c4d21f090798ce9c56a9bf","datavalue":{"value":"90C59","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2505314$7798DDC3-2007-4E51-BFA3-A2B75E162729","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a7ddaa80bf0a693a36c1113ff6b7ad576f729940","datavalue":{"value":"68W40","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2505314$D4FF164E-7116-4419-AA01-E972DA826A74","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"78daddb1288d43d7b34d23268e37376e9df989da","datavalue":{"value":"5060015","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2505314$83D6110A-9E50-4D72-8F0D-53C35EB5EA6C","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"252f9f9ed9fe8ca406cc19fba38a46c0414791ee","datavalue":{"value":"satisfiability","type":"string"},"datatype":"string"},"type":"statement","id":"Q2505314$5738A67C-22EE-4B15-A1AE-8B77C80EA0FA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"94c6d9adcf604dcae84ec3baf1711b8f20c0bda8","datavalue":{"value":"metaheuristics","type":"string"},"datatype":"string"},"type":"statement","id":"Q2505314$4F27BA15-61D6-45D8-8777-8AD6C18A2F73","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"bf901f582f5e2663e93db95dec887d1011d9aebd","datavalue":{"value":"Tabu search","type":"string"},"datatype":"string"},"type":"statement","id":"Q2505314$B1C3AF51-50B4-4AD1-A451-48AF45E97E98","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"754e144f5033db28cbf6c39951365b4d4e3ae61b","datavalue":{"value":"penalty functions","type":"string"},"datatype":"string"},"type":"statement","id":"Q2505314$4DD1520E-F3B2-4A30-BE26-8D7E0FBC36D2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e19098ef03b054cd16fe3d2cc8357bea11fdfda1","datavalue":{"value":"unconstrained quadratic program","type":"string"},"datatype":"string"},"type":"statement","id":"Q2505314$C3874D49-5D8E-47ED-A4EE-56726357633B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"59c5609aeb5d4bbf6d57930c671709bd5f983df0","datavalue":{"value":"Max 2-SAT problems","type":"string"},"datatype":"string"},"type":"statement","id":"Q2505314$C49F9907-8EB1-4168-ABF8-A2C909607BF6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6e68f5e21359249d51d9afea4168e8113e65eca8","datavalue":{"value":"combinatorial optimisation","type":"string"},"datatype":"string"},"type":"statement","id":"Q2505314$8F489D66-09A1-4AEF-ADC8-7812D725E033","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":"Q2505314$C1565F6D-BB3D-4C3F-ABD7-8E90F6857211","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"59827c4b897b2a95a004e974080f592e6e248ef4","datavalue":{"value":{"entity-type":"item","numeric-id":2439524,"id":"Q2439524"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c274b96fc96c608717a65accd82af7539052a5b7","datavalue":{"value":{"amount":"+0.7625109553337097","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":"Q2505314$6FB546CF-D6D7-4526-92B9-618E6E791C87","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"59292f6ff1751fbde4477d44cb2eaf5c3f68422e","datavalue":{"value":{"entity-type":"item","numeric-id":1841891,"id":"Q1841891"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"77e5f241d2117c699aa420718fab440813ce1811","datavalue":{"value":{"amount":"+0.7616614699363708","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":"Q2505314$E1014D29-5E38-42DC-B2D4-747E2D90D9E1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"fec5181653640d40c17597bbc5114109377a3ab3","datavalue":{"value":{"entity-type":"item","numeric-id":1278588,"id":"Q1278588"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b23aac3df8bbc51d69a5293bbcf535c302c0483b","datavalue":{"value":{"amount":"+0.7499130368232727","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":"Q2505314$C5C1C10A-7005-4DF5-96B5-19AE70C44ADF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5d3880ac4d3bcf9cd2cc861e574b4da1c8432192","datavalue":{"value":{"entity-type":"item","numeric-id":877032,"id":"Q877032"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"bdfdb4887d5f8fb43933303b89034e0536beb130","datavalue":{"value":{"amount":"+0.7461766004562378","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":"Q2505314$5E54C07C-670F-40C4-9A9B-B6B8B8624B4B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"5f63cad4882505533b99a217b3efff636dc10d46","datavalue":{"value":{"entity-type":"item","numeric-id":2506236,"id":"Q2506236"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f9b66571212669d9afd150f7ab6b3f114f518cfc","datavalue":{"value":{"amount":"+0.7454997301101685","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":"Q2505314$95B899A1-E682-4D44-BB9D-6E62C8F99F28","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Using the unconstrained quadratic program to model and solve Max 2-SAT problems","badges":[]}}}}}