{"entities":{"Q6310026":{"pageid":13446029,"ns":120,"title":"Item:Q6310026","lastrevid":94913213,"modified":"2026-06-05T07:57:12Z","type":"item","id":"Q6310026","labels":{"en":{"language":"en","value":"A Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900364961"}},"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":"Q6310026$1F05A087-F14D-4C5A-924D-33A33FA61456","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"dd5f23ee54392c85eac5a5d27f88a008ee6a7846","datavalue":{"value":{"time":"+2018-11-20T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6310026$997D8975-182A-4A06-A809-B2150C79F510","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5f08418ed51cad5599dcc4b3f8467177c40fd544","datavalue":{"value":{"entity-type":"item","numeric-id":6310025,"id":"Q6310025"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6310026$6CEE18B9-248C-4C5F-BACE-14877F0694DB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"418d3bc46a003aa13fdff57f8662aa62cf4eb967","datavalue":{"value":{"entity-type":"item","numeric-id":340338,"id":"Q340338"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6310026$E3CD727B-7576-47EC-ADBC-958190958052","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3862a501f099d63855e306f48f707221a7e9dd3b","datavalue":{"value":{"entity-type":"item","numeric-id":2306778,"id":"Q2306778"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6310026$E65C75F5-38C6-4E69-9D17-D6676F31CADC","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"29e9861b629466d8c967f7b0ec0ba19aaa490da9","datavalue":{"value":"900364961","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6310026$CC56DDA1-C9A5-4CC7-B72A-EE49BD79BB20","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":"Q6310026$962381A3-1E59-4100-B215-BF6AAD796C73","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Lagrangian_Decomposition_Algorithm_for_Robust_Green_Transportation_Location_Problem"}}}}}