{"entities":{"Q6230971":{"pageid":13367745,"ns":120,"title":"Item:Q6230971","lastrevid":94791326,"modified":"2026-06-05T07:41:57Z","type":"item","id":"Q6230971","labels":{"en":{"language":"en","value":"Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900135533"}},"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":"Q6230971$E4F58D47-0C60-4A49-9BC2-B6DC5E4D77CA","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6eb3272d0161057811dc00bb0e9bfbb7171fee74","datavalue":{"value":{"time":"+2012-02-13T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6230971$B0A3896F-C6D8-4FB6-99B3-15625C4A8E62","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9a0b8b03cddd966ac967cda4d4f1d1a53829de1c","datavalue":{"value":{"entity-type":"item","numeric-id":221931,"id":"Q221931"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6230971$47124E7D-E2E8-45A0-AE29-12B99419E176","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"75acc0bfd1968462814e9f595a617e17657e3965","datavalue":{"value":{"entity-type":"item","numeric-id":4427735,"id":"Q4427735"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6230971$15B2BC26-1A41-4EFB-AE2E-65FDA6B2F2D4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b37e714837cfe664001dbb9fcf4f79c88d078581","datavalue":{"value":"900135533","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6230971$984BEF6E-9FE7-4E35-8884-D9CBFCE415E2","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":"Q6230971$D0F53FE4-3A8E-4818-9ADC-C7AF008ACAF2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Strongly_Polynomial_Primal-Dual_Algorithms_for_Concave_Cost_Combinatorial_Optimization_Problems"}}}}}