{"entities":{"Q4740350":{"pageid":6769930,"ns":120,"title":"Item:Q4740350","lastrevid":90024566,"modified":"2026-06-04T18:53:55Z","type":"item","id":"Q4740350","labels":{"en":{"language":"en","value":"Solving a multiobjective traveling salesman problem by dynamic programming"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3795703"}},"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":"Q4740350$DA38B636-AE7E-40E3-9F87-1CDB56575809","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6b6eebe6fa99cb2ac9dbe2ee5876f8ff2b612384","datavalue":{"value":{"text":"Solving a multiobjective traveling salesman problem by dynamic programming","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q4740350$F69C7686-D30B-4113-B2F2-E4F214FC23D5","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"25256325b66c69d3c432eae127095ec8ef4be6dd","datavalue":{"value":"0504.90075","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4740350$9CB47A81-BE87-43E4-85F4-D442B9E58152","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"79f25c3653ae7106e80b429a020d1207466afbb1","datavalue":{"value":"10.1080/02331938208842786","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4740350$7CF9C12B-2246-478E-95CE-B006081ADC97","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"10309bafe0f9c884a5674507173947157c8273a9","datavalue":{"value":{"entity-type":"item","numeric-id":3037146,"id":"Q3037146"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q4740350$2355A548-AF42-4986-BD9D-1A3B1F5C7157","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"47f57cd36df9e30d446df3867dc3917e4ea74654","datavalue":{"value":{"time":"+1982-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":"Q4740350$84759583-203C-4795-9DF3-C19D48C6D5AB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"82a006ec5bbbadf5f063bfdc770a07a4120063ab","datavalue":{"value":"90C31","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4740350$4A5E6050-F628-4688-A9DF-2C038C6993D4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"aa3ca91474fff28e420d9cace433f8447ec799b0","datavalue":{"value":"90C39","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4740350$801100A9-476C-4BCF-9A52-B744F9941BFA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"d2d4f4e28fa9ca38421c473fcb6ba728a44de59a","datavalue":{"value":"90C35","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4740350$66C3875B-A9AE-4EBD-8E43-0F38150A2463","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"53e9f12715d627260575c7daba6992a95da91608","datavalue":{"value":"3795703","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4740350$4651BC4D-A9FF-4555-A090-FD0C34B6B769","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"29ecb0eef0bb569eb468a990677812a50a2f5977","datavalue":{"value":"multiobjective traveling salesman problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q4740350$7CED40C7-0B52-436F-B0AF-1CB086A8F1E3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ccbdc2b70f9967784c6aa2628ac84d173f0898a7","datavalue":{"value":"multiobjective dynamic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q4740350$7EB2C2C1-463C-4084-BE38-6E2819ECF1A5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"20ea66b2a29e434336a6f13e5c40c950de708974","datavalue":{"value":"two-dimensional traveling salesman problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q4740350$49C56FA8-2CD7-4578-B226-DA03990979A0","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":"Q4740350$3064A846-E022-40C3-AD39-D8697180848C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"349c1f3bedc3ce20528213492f2e4164dc9da92d","datavalue":{"value":"https://doi.org/10.1080/02331938208842786","type":"string"},"datatype":"url"},"type":"statement","id":"Q4740350$F1491D85-B71D-4854-929C-C150CD0A6922","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"7e4a67ab4106ec750d8636a7dafa25c94e2b155f","datavalue":{"value":"W2107229229","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q4740350$D075F463-BC86-426D-8DA3-9C1FEE1E0690","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Solving a multiobjective traveling salesman problem by dynamic programming","badges":[]}}}}}