{"entities":{"Q86629":{"pageid":87909,"ns":120,"title":"Item:Q86629","lastrevid":59734095,"modified":"2026-04-10T13:45:12Z","type":"item","id":"Q86629","labels":{"en":{"language":"en","value":"A modified Frank-Wolfe algorithm for solving the traffic assignment problem"}},"descriptions":{"en":{"language":"en","value":"scientific article"}},"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":"Q86629$A7CCD7D4-93B7-434A-B4CC-D3142BC13341","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"91740fed3cf678a1cb9acc0fc19c802db682efa1","datavalue":{"value":"10.1016/0191-2615(84)90029-8","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q86629$C9F07AD9-F511-4E29-9FB2-B87C4443C990","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"1cdedde192ff061aaef483c624495c52861726c2","datavalue":{"value":{"entity-type":"item","numeric-id":86627,"id":"Q86627"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q86629$507C12BB-3102-4327-8B1C-8C7C37FC2DB5","rank":"normal"}],"P26":[{"mainsnak":{"snaktype":"value","property":"P26","hash":"bad5651cfc2dc7dc1c022d978ceb9ecd7a33bd92","datavalue":{"value":"18","type":"string"},"datatype":"string"},"type":"statement","id":"Q86629$33E7E15C-F467-489E-8666-032CDA7F20E0","rank":"normal"}],"P25":[{"mainsnak":{"snaktype":"value","property":"P25","hash":"b8f23e21c54d542f784defaef10454ba7971b38a","datavalue":{"value":"2","type":"string"},"datatype":"string"},"type":"statement","id":"Q86629$0211D707-1933-4D84-A4B2-B24633BD8F7E","rank":"normal"}],"P128":[{"mainsnak":{"snaktype":"value","property":"P128","hash":"58a486c6bf3438de43e31d0ec3e0dc79c3fe9457","datavalue":{"value":"169-177","type":"string"},"datatype":"string"},"type":"statement","id":"Q86629$A9C4982F-2E9C-453A-82B8-2905A4629270","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"9878199c1283a6a0bfd780fb2dcf472c71c4d144","datavalue":{"value":{"time":"+1984-04-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":10,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q86629$55677DF4-B9DA-4A67-9D1E-EE5B704D8C40","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d18e0a796007696c7292dd8e0e87e9bdf7c5b66d","datavalue":{"value":{"entity-type":"item","numeric-id":86628,"id":"Q86628"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q86629$7A97CFDB-123A-40A1-A28C-B34EE75ECFAC","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":"Q86629$08B4421B-2D5E-477F-959C-04CE63C2DE06","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"8883948a860b9a7e937fb9f8d62efaaf445452cd","datavalue":{"value":"Q56763834","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q86629$0D20B57B-1FF9-493A-B9A6-3DE96C93495C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A modified Frank-Wolfe algorithm for solving the traffic assignment problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_modified_Frank-Wolfe_algorithm_for_solving_the_traffic_assignment_problem"}}}}}