{"entities":{"Q6979439":{"pageid":21379677,"ns":120,"title":"Item:Q6979439","lastrevid":76266204,"modified":"2026-04-23T11:21:15Z","type":"item","id":"Q6979439","labels":{"en":{"language":"en","value":"Approximate Linear programming for a queueing control problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8045256"}},"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":"Q6979439$9F0E7AED-EBF4-4176-BCD6-CE92F39512E5","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"226c1dce38b68402290ec83adc448915ea26ebac","datavalue":{"value":{"text":"Approximate Linear programming for a queueing control problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6979439$F53CF835-694E-47D0-8339-12A0F65283B7","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"08f8e1ed27cc1e4cee1f122fbdd423cd4e8e1537","datavalue":{"value":"10.1016/J.COR.2024.106711","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6979439$D5466CCD-13A6-4260-9897-5D656DF0DB91","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"6a1e23e60b64d69135592adb719ac9607a0e40f8","datavalue":{"value":{"entity-type":"item","numeric-id":4604899,"id":"Q4604899"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6979439$39BC75D6-A59E-4588-A941-86D3E8850D26","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7a2889f95ce6ecf9d9a9bfa668dc751f42ecd16d","datavalue":{"value":{"entity-type":"item","numeric-id":6563453,"id":"Q6563453"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6979439$899E3A05-BF4B-4B77-9F25-0C1F371F4EB4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4c24de580a2a943abc56cb734cc245cc69ca5b45","datavalue":{"value":{"entity-type":"item","numeric-id":6112564,"id":"Q6112564"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6979439$43F1367D-0C04-4DB8-9F82-D9ECE3B6DB2F","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"e630590c5ca6e787c3c7b5e291898405495fea2b","datavalue":{"value":{"entity-type":"item","numeric-id":162215,"id":"Q162215"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6979439$40C2DF09-5FBF-45BD-9BD0-7CC1FC2D314E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"89c6ef824894ecd8ca1a4a8bead8f2e704f9553f","datavalue":{"value":{"time":"+2025-05-26T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6979439$9FC24E94-8221-48B9-830F-C30E05A81722","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"8a85201ebca62a854a65ce75a75de972f8676151","datavalue":{"value":"90Bxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6979439$41AEAAE7-328F-4C31-BF33-BE3DC72FCC51","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"4664831d9e2454458ae77d3393b5ea6e61d0e0c8","datavalue":{"value":"8045256","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6979439$45C6BC76-95F7-4720-A21E-C0702C9649BD","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0d82cfa81638332a8c825bcbbd9d7f7f9c0c45be","datavalue":{"value":"dynamic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q6979439$266CBCCD-A3AC-4388-95F5-ED63D9DE0246","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"346d2cc3a657c4d33b736000a1ae6fcc72e0e172","datavalue":{"value":"queues","type":"string"},"datatype":"string"},"type":"statement","id":"Q6979439$2E67096D-D0E0-428D-9AF0-F4B99074E2DA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d1c0c0c01c50cc96b8a73ed18a32f4d0267d6fab","datavalue":{"value":"approximate linear programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q6979439$DC7A2CAC-7E9B-47D0-A651-1543F5C4E5D5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"33b040cf1037178784589fc6393d9de550370bba","datavalue":{"value":"admission","type":"string"},"datatype":"string"},"type":"statement","id":"Q6979439$BD3E1916-A6A8-4A34-BDE8-769077CCAA67","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":"Q6979439$5CA2C8E6-82AC-45EF-A7B0-45F91A4D2C4D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Approximate Linear programming for a queueing control problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Approximate_Linear_programming_for_a_queueing_control_problem"}}}}}