{"entities":{"Q2783871":{"pageid":2794609,"ns":120,"title":"Item:Q2783871","lastrevid":83404892,"modified":"2026-05-07T07:35:01Z","type":"item","id":"Q2783871","labels":{"en":{"language":"en","value":"A linear programming model for the single destination system optimum dynamic traffic assignment problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1730906"}},"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":"Q2783871$CE03B9BE-23A9-4508-A3AB-A0FFA8C3CE9C","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"185553789ce3c2c7ff016100ff9b9cfaf55e224b","datavalue":{"value":"1002.90013","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2783871$2D9E557C-F2C4-4A25-B4D5-3EF2C156435A","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"4dcafa569b26f35e2ed2e5c8c4c4caae0cf19841","datavalue":{"value":{"entity-type":"item","numeric-id":86630,"id":"Q86630"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2783871$D6F71E6D-3773-4996-9059-04CAED8CE163","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6863e602815acb5f8df8b9dde489285ae2aa87d0","datavalue":{"value":{"time":"+2002-04-17T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2783871$668CCE4F-5A62-43D6-8F06-731CDC7E9D48","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"1c819bcbc5228a4c15a0698bc48e27bac5cf3646","datavalue":{"value":"90B20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2783871$279C3A51-0E44-4A1E-892E-15726D1DF6FC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8ad37711539483f94ecc5e7c9236f6acd7c19a03","datavalue":{"value":"90B80","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2783871$C11618E3-B3C1-44FC-BA59-D1226472EF3F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"9cf44d503e7d4771a74e60c8b165d38259abcf57","datavalue":{"value":"90B10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2783871$34330499-B401-49E9-A104-DEC02444A1CF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"36d142e7ea03446b1d7deb9627eedb9f0297f86a","datavalue":{"value":"90C05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2783871$7E0EDCEA-9486-41CC-B57E-D4B2E98F928B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6c409fc33075df7764aadc356cca96a4c4419907","datavalue":{"value":"1730906","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2783871$CACBD295-C32C-4659-BA40-B3585793482F","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4901c88c254883d3f81ed98c588ea7267e35f73f","datavalue":{"value":"linear program","type":"string"},"datatype":"string"},"type":"statement","id":"Q2783871$FFD11DB4-E688-4311-A511-5733AA4A8D09","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d375b47f0f471a9899171d95e48ece1cce2e2e0d","datavalue":{"value":"system optimum dynamic traffic assignment","type":"string"},"datatype":"string"},"type":"statement","id":"Q2783871$B054FF80-2B50-442D-B44E-1C294D7E39C2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d2e9791b8f2ff2e392a7e93bf0e2e1ca36659af7","datavalue":{"value":"dynamic network","type":"string"},"datatype":"string"},"type":"statement","id":"Q2783871$04C2349D-D533-4D1C-B1F8-6F6F5AD8450E","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"99045309fcc0b7b434f86b35e0f51b08336d25fe","datavalue":{"value":{"entity-type":"item","numeric-id":1027581,"id":"Q1027581"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2783871$9D1FE55B-9E36-4C13-BDA7-AA6DD98DF0F8","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":"Q2783871$9B82D634-FEFF-4AC8-8E77-ADB1D92F9BD4","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"be8fcdebf4fe6c02f7c203317f1750720f25957c","datavalue":{"value":"https://doi.org/10.1287/trsc.34.1.37.12281","type":"string"},"datatype":"url"},"type":"statement","id":"Q2783871$1ED1033C-6650-4132-BBEB-C58A6E81DC62","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"3fa4cbb1654d4555059b8be92c9d506365f293ec","datavalue":{"value":"W2120646221","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2783871$49ABAABE-DD97-49C0-9BAE-15C5F84F930E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"06d11fd783ff3607b6e07431e81b1fdbce961fce","datavalue":{"value":"10.1287/TRSC.34.1.37.12281","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2783871$B11982F6-F6C1-46D2-AA98-ADF98EFEEB7F","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"41fcdb78711f308346d233bc2ce5513397c58d9d","datavalue":{"value":{"text":"A linear programming model for the single destination system optimum dynamic traffic assignment problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2783871$242BCE9D-F4A6-4659-982A-7B9BFC54DC93","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"aec907837e67a150b4a01f02e90b4fbac94764fb","datavalue":{"value":{"entity-type":"item","numeric-id":3328216,"id":"Q3328216"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"524d2da60abc546842e097577b3b9860df64286c","datavalue":{"value":{"amount":"+0.8415701985359192","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2783871$B89A7227-4ADE-4B81-B8D3-EC09AE55DF60","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"6ca5ee9cf80d7adc1d297b21f14744c695729f84","datavalue":{"value":{"entity-type":"item","numeric-id":4971585,"id":"Q4971585"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"b7bfcfc24b05f4e48bccd903298a24fac43737b5","datavalue":{"value":{"amount":"+0.8314363360404968","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2783871$D81D8B84-E7B9-46CD-88CC-7EBAE83A5822","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"b1fc6c1419319078daf2a7ac56ac71a99c03d809","datavalue":{"value":{"entity-type":"item","numeric-id":2460110,"id":"Q2460110"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"189c128aa9919bb11b40c4480a8fee77270a3e23","datavalue":{"value":{"amount":"+0.8189418315887451","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2783871$74A7C4D7-FC61-4872-976B-ECE2E59567DE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"4dd77fc4948688261c6768e7f8d3db3a34f87807","datavalue":{"value":{"entity-type":"item","numeric-id":2030327,"id":"Q2030327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"f3a744b718b55f816ca02edcf2d7fac5136d14c3","datavalue":{"value":{"amount":"+0.8049403429031372","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2783871$6954C8D3-DFAF-414A-B8EE-8C322F9E684C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3ca53c5c54d0352c1a35cd0e418e52643020b321","datavalue":{"value":{"entity-type":"item","numeric-id":4834032,"id":"Q4834032"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"401742da0c794f33cfa62e10d8c0475698b2d0d2","datavalue":{"value":{"amount":"+0.7952040433883667","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q2783871$89A157E1-7290-4B30-BB4D-F81C3D9BC63C","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A linear programming model for the single destination system optimum dynamic traffic assignment problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_linear_programming_model_for_the_single_destination_system_optimum_dynamic_traffic_assignment_problem"}}}}}