{"entities":{"Q5518974":{"pageid":7548534,"ns":120,"title":"Item:Q5518974","lastrevid":96362360,"modified":"2026-06-05T11:02:34Z","type":"item","id":"Q5518974","labels":{"en":{"language":"en","value":"A comparison of the primal-simplex and primal-dual algorithms for linear programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3230935"}},"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":"Q5518974$802D4480-B809-43BF-A559-7D77AD799A90","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"c22768d6f38487a17f487330109e551b45efc160","datavalue":{"value":{"text":"A comparison of the primal-simplex and primal-dual algorithms for linear programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5518974$83E57D95-1753-480E-82F3-875A66F9B456","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"cbfd586041b0b12a8526058270f0bbad3e60d83c","datavalue":{"value":"0143.21402","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5518974$E4D8ABF6-CCA0-40B4-9234-77C0C73275E1","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"cde672e797a5c53b17322e12275903165f625511","datavalue":{"value":"10.1145/365660.365682","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5518974$93F18FF7-3041-4C6D-8039-8E4714DD7B06","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"925438df27861b7d02fa09d3cef839f4f0e766fe","datavalue":{"value":{"entity-type":"item","numeric-id":5518973,"id":"Q5518973"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5518974$A146D759-1888-4315-B2DF-12FD3ECF41CA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"386dbe106f16386188dbc87ef8b3a2a11058ab88","datavalue":{"value":{"entity-type":"item","numeric-id":1148105,"id":"Q1148105"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5518974$B6724B2F-4083-4D01-B9DB-1312F471B98E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"cc846cc700dc846702740028966828f297420cb4","datavalue":{"value":{"time":"+1965-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":"Q5518974$B90E5548-B1D4-4296-AA1A-4CAD23BA2EE3","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9f410c3ce699f1d96c789f67f376bb61ae423b7a","datavalue":{"value":"3230935","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5518974$E96F6BCB-0673-450B-9FCE-672D4444B865","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3ddc2790f83291413186a9651d6c4959058d194f","datavalue":{"value":"operations research","type":"string"},"datatype":"string"},"type":"statement","id":"Q5518974$78895807-2974-4711-AEBD-72E3199D98B4","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":"Q5518974$DBFC0905-8B1F-4FC8-B089-CB952C380640","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"66bebc6fc5b4e22bb335841561534015ee20a17b","datavalue":{"value":"https://doi.org/10.1145/365660.365682","type":"string"},"datatype":"url"},"type":"statement","id":"Q5518974$D06F78D8-FD74-453E-8E9E-D84C434D4B38","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"f5e1908307509238482267bda15ac2ef053c9704","datavalue":{"value":"W2052971759","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5518974$1717A3E9-D434-493E-888E-68176EDB49E1","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"ad45996cf730fdb3f9732db0bd2d9de22fa0a7b7","datavalue":{"value":"Q128523585","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5518974$629F58E0-659C-4492-9770-AD06C2F01520","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"087426e75e65ba42be09a15851f31de13b7aa5f3","datavalue":{"value":{"entity-type":"item","numeric-id":56730,"id":"Q56730"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5518974$0163DE72-3267-46B3-AA0D-A91B2444AD81","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A comparison of the primal-simplex and primal-dual algorithms for linear programming","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_comparison_of_the_primal-simplex_and_primal-dual_algorithms_for_linear_programming"}}}}}