{"entities":{"Q1111950":{"pageid":1122699,"ns":120,"title":"Item:Q1111950","lastrevid":66749256,"modified":"2026-04-12T12:36:11Z","type":"item","id":"Q1111950","labels":{"en":{"language":"en","value":"Efficient application of nonserial dynamic programming in combinatorial optimization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4076995"}},"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":"Q1111950$3E624863-D0A5-4E7C-8C3B-33F60598F436","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"22dcfaf566269918c44fe61df23a9ea15a459a33","datavalue":{"value":{"text":"Efficient application of nonserial dynamic programming in combinatorial optimization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1111950$3AC79205-3207-4480-AD61-D39567A11AD6","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"9a327861897b44668606d11bd7745b00e140caa7","datavalue":{"value":"0658.90096","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111950$2843D2FE-4A6E-4F9B-97BB-75C93A41DE9E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9e3e3f28053f72b95be756f08e620321bbef1843","datavalue":{"value":{"entity-type":"item","numeric-id":1111949,"id":"Q1111949"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111950$45AB9172-0A4D-43D5-8435-88EDA42BA2C4","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"33359fd8a77e9cce0cfaf7c91dc047e11a0fed75","datavalue":{"value":{"entity-type":"item","numeric-id":109332,"id":"Q109332"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1111950$8C1F6494-CAA3-4B33-8A97-1A09E564FF1A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"31a1937240ca4a323604b4728c31d242b5596d7c","datavalue":{"value":{"time":"+1988-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":"Q1111950$382CC3BC-FB42-42DF-A310-0E6F02B15C1C","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"2eb1098f6e4e41c30ba05cbf6e3bcd1f1858c5a6","datavalue":{"value":"This paper presents sufficient conditions for polynomial convergence of non-serial dynamic programming. A corollary yields polynomial algorithms for solving some well-known optimization problems on new classes of graphs.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111950$321018AC-5017-4021-A6DD-EC6D84356B19","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"aa3ca91474fff28e420d9cace433f8447ec799b0","datavalue":{"value":"90C39","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111950$1CF5082D-8EA4-45EC-9332-4E6D5A163E24","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111950$B2F9E057-9275-4555-867D-069C804DCD6B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111950$BABE8DAA-5825-48CA-B080-BD5F06718D3C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"648556acd798f26b66680da47f8510fee829430e","datavalue":{"value":"4076995","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1111950$3B67E689-FBC8-4E03-84D8-C33089E45BA4","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5886f86ce5fc9c4fb9669ccaee5b781116a19c2e","datavalue":{"value":"sufficient conditions","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111950$30568D3C-432E-4068-AC4A-4B4BC013D780","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e827df994b826f65c90d0a406b72841c3a08cdf3","datavalue":{"value":"polynomial convergence","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111950$90764385-8A06-495A-B0F7-632A140B9EA8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a9d1b2ce13ed43abe7b62425bd480b7210ea9838","datavalue":{"value":"non-serial dynamic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111950$3C1BAC0F-A364-4B1E-B2F5-D7ADA8399CF1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3b6d19d4c43b54c850c0e7b873f523866d352b6c","datavalue":{"value":"polynomial algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1111950$4563256A-F731-45EA-B215-0DF29747F3DF","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":"Q1111950$CF5EA69B-7182-4182-98EB-3BAE17BA48F6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Efficient application of nonserial dynamic programming in combinatorial optimization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Efficient_application_of_nonserial_dynamic_programming_in_combinatorial_optimization"}}}}}