{"entities":{"Q5930000":{"pageid":8106802,"ns":120,"title":"Item:Q5930000","lastrevid":97596917,"modified":"2026-06-05T15:04:05Z","type":"item","id":"Q5930000","labels":{"en":{"language":"en","value":"A simple finite cone covering algorithm for concave minimization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1587232"}},"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":"Q5930000$0A217498-2B9D-41F0-B9C5-791994F09D9D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"9dfb0610b7730a0fda55a8784b5e84f60a8df19e","datavalue":{"value":{"text":"A simple finite cone covering algorithm for concave minimization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5930000$D19D4041-119D-4E78-8EFE-73327525A0C0","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"fe0041f44fbd2c39ddd97f289620bdf0e316b56f","datavalue":{"value":"0974.90017","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5930000$CF159CE9-F258-4239-94BB-548129768218","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"1a62ef13d2b522c2f69f0654137f3ecf06fb05e4","datavalue":{"value":"10.1023/A:1026548217241","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5930000$F4599974-2795-41B0-B8B1-2F7332D952C5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"0b78a977a1f222d4e9990f62ba381109b130d30a","datavalue":{"value":{"entity-type":"item","numeric-id":172153,"id":"Q172153"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5930000$DE686126-4572-456E-8AF3-FAB2FF47D054","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"8c9a1d032b4dee05705e8b2f4f60118816c12892","datavalue":{"value":{"entity-type":"item","numeric-id":116038,"id":"Q116038"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5930000$3BE26CCA-9B84-473D-A973-E5EC42A7557E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"cff48275765814590658d506aafb5ce41ac2a492","datavalue":{"value":{"time":"+2001-12-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":"Q5930000$C48E84E0-5264-4CE5-9137-91754264CEB6","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"ccb6e483f33886d76dfca859069363dd937e35d6","datavalue":{"value":"One of the classical solution methods for concave minimization problems over a polytope is the cone covering algorithm by Tuy. This paper proposes a new simple covering scheme using cones with \\(n\\) extreme rays and requiring only two linear programs per cone. Especially, easy conditions to detect cycling are given. Also the finiteness and correctness of the presented algorithm ist proved.","type":"string"},"datatype":"string"},"type":"statement","id":"Q5930000$28BDFA0E-FB27-4A0D-9E1A-B55EBB9EF145","rank":"normal"}],"P1447":[{"mainsnak":{"snaktype":"value","property":"P1447","hash":"e2c96c31c505bb36052d6d9a1e06ebdcc9d76af6","datavalue":{"value":{"entity-type":"item","numeric-id":166236,"id":"Q166236"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5930000$10D3E150-055F-4E2D-8175-DA0278806CDC","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed10a41ec587cb61dc683f25ef4b3e827c7fee2f","datavalue":{"value":"90C26","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5930000$BE55B6FE-97D5-48B2-BF49-075805CAB624","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"52de7d4bf5a27d5ad252804eec58396bb3e40c44","datavalue":{"value":"90C30","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5930000$5AD56AD7-C483-4E57-AD1F-75112A3AC828","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e4417c132691276f529b9770d8a9c326aa6ebe04","datavalue":{"value":"1587232","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5930000$9A391200-0796-4607-9FFE-B0E314B7898A","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e1896414e2c736fd254f64ae61addb608a816345","datavalue":{"value":"concave minimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q5930000$60035273-D14B-4F97-97CD-2EAE09ABD675","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"cb60490d9acf67febfb440d2866b570f3221a9d2","datavalue":{"value":"cone covering algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q5930000$D965F294-9077-4E0F-A05F-DE9F57004DA5","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":"Q5930000$D72702CA-C348-4660-8FED-90933A7434CA","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"c294c3101aaeedfd8adcdbeb278800365482f256","datavalue":{"value":"https://doi.org/10.1023/a:1026548217241","type":"string"},"datatype":"url"},"type":"statement","id":"Q5930000$C9EA1805-ADBE-45A6-B3B6-07B41A56831D","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"1977c49e93270af80029a6b3391900b4f0fdf448","datavalue":{"value":"W54258423","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5930000$87F17A2C-4A6E-4E26-9C62-A85231C85AA0","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"ed2464bc4c26c08be74b983ca0373ddff16d9dd3","datavalue":{"value":{"entity-type":"item","numeric-id":4550775,"id":"Q4550775"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"4fd8ff03b8f91ee9546b095e80054a24957d1c61","datavalue":{"value":{"amount":"+0.9207788705825806","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":"Q5930000$B6DE0C87-506E-4367-B122-5F6DAFC05AF0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"40b9986daa2c3e427cf5c37d2a2768240dfde4e3","datavalue":{"value":{"entity-type":"item","numeric-id":4552722,"id":"Q4552722"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"675a7d0102c50861160f5c1751fe8fc44a93b246","datavalue":{"value":{"amount":"+0.8446754217147827","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":"Q5930000$2BF73ACF-6D64-4E7D-A352-1B8D42EE17B2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"f3f881259a4143f4b29332c63991850a7de1bc9b","datavalue":{"value":{"entity-type":"item","numeric-id":1177231,"id":"Q1177231"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"3a8583cc30f93449dd00628916c5247e90fcf627","datavalue":{"value":{"amount":"+0.8417389988899231","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":"Q5930000$0F0C9480-C96C-405C-931E-7958EF0E2187","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"08bf5fe42169f22bc0db09504ac0e6eea5431519","datavalue":{"value":{"entity-type":"item","numeric-id":811411,"id":"Q811411"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b38e108b67010caec0d3b2cbc66c29b4a1fffdb4","datavalue":{"value":{"amount":"+0.8289566040039062","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":"Q5930000$692B3B29-8F02-4775-AE8A-D33DDA456826","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"9b9076704b66352c529d7a08e592d3d340dba964","datavalue":{"value":{"entity-type":"item","numeric-id":3705227,"id":"Q3705227"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f15751af7bc46bcc9f70c71836fd5982b26b8b4f","datavalue":{"value":{"amount":"+0.8236383199691772","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":"Q5930000$601D55B1-5873-4C85-8024-2DDFAC5F7F44","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A simple finite cone covering algorithm for concave minimization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_simple_finite_cone_covering_algorithm_for_concave_minimization"}}}}}