{"entities":{"Q2742685":{"pageid":2753424,"ns":120,"title":"Item:Q2742685","lastrevid":79252943,"modified":"2026-05-06T13:29:54Z","type":"item","id":"Q2742685","labels":{"en":{"language":"en","value":"Improvements for an inner approximation method for reverse convex programming problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1650294"}},"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":"Q2742685$3B5F38D0-5CFE-460E-B494-7E18890BA9E2","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"4d0135adddd7455949c260c6ca79ba7f537d006f","datavalue":{"value":"0969.90509","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2742685$CF76F532-11B6-4448-BE8F-527B8AF21175","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"eae7e1f20c818834900666b4533e83896daa3a74","datavalue":{"value":{"entity-type":"item","numeric-id":938123,"id":"Q938123"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2742685$D0D76058-1469-4BAD-BA5B-26807F95F120","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"d61047e980378b7969ab150885f5fe8f56f988b3","datavalue":{"value":{"entity-type":"item","numeric-id":208959,"id":"Q208959"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2742685$67FB3712-8FDC-4A25-9E7B-B9D1EA480F4E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"843ad2e1eb425ff4a26499d18ec5697c90196aef","datavalue":{"value":{"entity-type":"item","numeric-id":439349,"id":"Q439349"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2742685$22FB5631-A417-4679-9200-6B49AC8FD0A7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"97645e3d324abd87f41b2deda696fde359f8ec62","datavalue":{"value":{"entity-type":"item","numeric-id":168097,"id":"Q168097"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2742685$5C74F015-EB6C-4331-9A84-84C5C6A75B0D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"bbe75a70230035dd524404f684e8680186c503aa","datavalue":{"value":{"time":"+2001-09-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2742685$0DA4E084-0719-4125-ABCA-6C63D5D3183E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ccd1dd4cefa81e8158b9f080486a4eaed61a9ee8","datavalue":{"value":"90C25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2742685$95267777-6279-4008-80EE-2889366D3936","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f32744f6750b6fdbfed790be15665d7649cbcea7","datavalue":{"value":"1650294","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2742685$923BF3AD-D85E-4EAD-962C-CCA84E6B2826","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":"Q2742685$A62B3AD9-E25D-427A-A473-32F803A18F11","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"152d2a34f12aa887ede18c4d56e4cab3b51135d1","datavalue":{"value":{"text":"Improvements for an inner approximation method for reverse convex programming problems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2742685$04E51AD8-2703-474E-8500-EFB1E3B02B9F","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"1fa57fbabc9c9a9f93e18694454b754a27139fc3","datavalue":{"value":{"entity-type":"item","numeric-id":6767942,"id":"Q6767942"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2742685$580FF068-1D38-4DA6-A13B-9A6BB0A648E0","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Improvements for an inner approximation method for reverse convex programming problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Improvements_for_an_inner_approximation_method_for_reverse_convex_programming_problems"}}}}}