{"entities":{"Q4158822":{"pageid":6188422,"ns":120,"title":"Item:Q4158822","lastrevid":89382632,"modified":"2026-06-04T17:11:12Z","type":"item","id":"Q4158822","labels":{"en":{"language":"en","value":"An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3591728"}},"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":"Q4158822$8D45AD40-B01B-4285-9D9A-79A067E3561E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8a11804a303e824012d6796153e23ffe5884f851","datavalue":{"value":{"text":"An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4158822$A09C805B-B0E2-40BF-B29C-A8AC5E53ED0C","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b8fc7d277113f27436a436b64ab06d334e8bac4a","datavalue":{"value":"0379.90082","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4158822$D6EA5DB1-6C45-42D8-A90D-97DC3F8BCA60","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c33288df7e226bae5fe4c2853d98a19aed02117e","datavalue":{"value":{"entity-type":"item","numeric-id":1082311,"id":"Q1082311"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4158822$391B4C50-212E-4916-BFBB-0F0D740BAE53","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"e65e5835af9de26707f74dfee72aee1cd18dbebb","datavalue":{"value":{"entity-type":"item","numeric-id":3025760,"id":"Q3025760"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4158822$05C47998-64E4-4E71-A999-60CA3EFB1FFD","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"23512e79b17ec0dbe00d89a570006ab4e1ecd403","datavalue":{"value":{"time":"+1978-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":"Q4158822$3FD33824-936D-44F1-BE56-784AC224FCF0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"b4d4b880941bb65ec306ce9d3141ff7e82566f56","datavalue":{"value":"90C20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4158822$AC418781-4FF7-48CF-9FA0-91D154F12630","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"36f92060e0e913cfa3d9366834da38cfde459e1d","datavalue":{"value":"3591728","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4158822$0B429A9D-A69F-4613-9A0B-C76EE0EB3FBC","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":"Q4158822$97E4195B-22E0-4DD3-8A12-671937AA25BB","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"775ebd54fecbaf5febd7186cda7a4c0f10d0674c","datavalue":{"value":"10.1007/BFB0120780","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4158822$5A7F0276-312C-4F46-ADDB-59D698CAC92C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An efficient implementation of the Lemke algorithm and its extension to deal with upper and lower bounds","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_efficient_implementation_of_the_Lemke_algorithm_and_its_extension_to_deal_with_upper_and_lower_bounds"}}}}}