{"entities":{"Q1589147":{"pageid":1599887,"ns":120,"title":"Item:Q1589147","lastrevid":74291085,"modified":"2026-04-14T19:22:11Z","type":"item","id":"Q1589147","labels":{"en":{"language":"en","value":"Axial three-index assignment and traveling salesman problems: fast approximate algorithms and their probabilistic analysis"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1541558"}},"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":"Q1589147$4C612FA9-9C12-49FF-9CD3-F87D77D7AC44","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"0783d73e90ed6763b1e2001290002e1e65c8992e","datavalue":{"value":{"text":"Axial three-index assignment and traveling salesman problems: fast approximate algorithms and their probabilistic analysis","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1589147$3EBBC10D-D8FB-49C2-ADFE-3BFA68652D20","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"499d593a786a3c8d75fd774b1b30082b66f71133","datavalue":{"value":"1049.90528","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1589147$640EF1A1-63C5-42A4-BA34-E31C7257E1BD","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"54f70aad717531caef43ec23cc657178439368f8","datavalue":{"value":{"entity-type":"item","numeric-id":1589146,"id":"Q1589146"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1589147$3BA3F4F0-37E0-4132-8380-792852011839","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4d04198bca28da6696c695b23c84ec1d09f4efb9","datavalue":{"value":{"entity-type":"item","numeric-id":294359,"id":"Q294359"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1589147$51719ECC-E11F-459A-AAC8-ED43CCB6CF45","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"62318960435ff4e0b6f0bda102e1b989b0fc569e","datavalue":{"value":{"entity-type":"item","numeric-id":268929,"id":"Q268929"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1589147$82EF9B2D-7F1B-44C9-9B21-7310A562A935","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"5d44b740cc16a5c0503e68c41530b9daa0bc7ab3","datavalue":{"value":{"time":"+2001-03-07T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1589147$983CD5E6-572F-46F7-A74F-DBC12B3AA5B6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1589147$373B14FC-B81A-48C5-8F35-122EEABFA582","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"80d132150dd88753814aff9086263a07bfe281b4","datavalue":{"value":"1541558","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1589147$C32792C5-853D-4264-BDA7-C6A02BDBCFD8","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":"Q1589147$9D729EA1-CF92-4A47-8CA6-8A1EF21AE14B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Axial three-index assignment and traveling salesman problems: fast approximate algorithms and their probabilistic analysis","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Axial_three-index_assignment_and_traveling_salesman_problems:_fast_approximate_algorithms_and_their_probabilistic_analysis"}}}}}