{"entities":{"Q2740122":{"pageid":2750861,"ns":120,"title":"Item:Q2740122","lastrevid":79191479,"modified":"2026-05-06T13:21:08Z","type":"item","id":"Q2740122","labels":{"en":{"language":"en","value":"Cut-off in linear partially combinatorial problems of Euclidean combinatorial optimization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1646522"}},"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":"Q2740122$9BE818CA-5121-49C8-894C-342F7E37DE34","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"733fdabe2f6e969c155b1e37bf33a1b70ec0850d","datavalue":{"value":"1054.90627","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740122$D66E2AFE-3D41-419C-9231-34E0FE61A75A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6fa4324d5f31025fe1f27454d1eabe531b618276","datavalue":{"value":{"entity-type":"item","numeric-id":2740120,"id":"Q2740120"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2740122$F6D6D7A0-C888-47D0-835A-FD9E6FECC8EE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"074503d690c3365c0c11a4863e4324544314930e","datavalue":{"value":{"entity-type":"item","numeric-id":2740121,"id":"Q2740121"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2740122$F6BD6886-FD76-4BFD-AFC9-70948D393A5D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"81f8906f510a1a7a3f5462e696b50f1cf7c22137","datavalue":{"value":{"time":"+2001-09-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":"Q2740122$52D15F84-67F4-4E52-A433-23A5ABB48C73","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740122$11E50BBE-EBC4-4407-A4AC-F01598F72679","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3feee98fb6a1a95642ba0c6a16390527874922bf","datavalue":{"value":"90C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740122$EA2AC023-10B0-4137-8DF2-DB47367071DE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1cee3860cb382a5504fa841b6ea847e1d5c82ef6","datavalue":{"value":"1646522","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2740122$8A8E56C3-D689-4F2A-818A-E5C5358A6B89","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"abd7be9a5895d323b2ee3bd79089d906021a7e2a","datavalue":{"value":"Euclidean combinatorial optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q2740122$ECBE97E1-CD04-4FD3-ADBB-C0330E0DCA20","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9b40ad0d5b1aaa27632d2460c3be85a1c289a195","datavalue":{"value":"linear objective function","type":"string"},"datatype":"string"},"type":"statement","id":"Q2740122$9367A369-71B7-4085-8065-DC6D963E7D2D","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":"Q2740122$E921CB07-6ACE-4BE5-8327-8FCE5E7FBE5F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"82f6e33aaaed323233c88c18eb7dd59cec149437","datavalue":{"value":{"text":"Cut-off in linear partially combinatorial problems of Euclidean combinatorial optimization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2740122$B34C3F7D-63CD-4418-A937-AFFDA031D031","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a3717dd56be2d3d5c16be6027f391ec6a966de15","datavalue":{"value":{"entity-type":"item","numeric-id":6568545,"id":"Q6568545"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2740122$6374C71C-B5D4-4D0E-9F4F-6B6066C36ADC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Cut-off in linear partially combinatorial problems of Euclidean combinatorial optimization","badges":[]}}}}}