{"entities":{"Q3883900":{"pageid":5913805,"ns":120,"title":"Item:Q3883900","lastrevid":90894470,"modified":"2026-06-04T21:42:26Z","type":"item","id":"Q3883900","labels":{"en":{"language":"en","value":"A Cutting Planes Algorithm for the m-Salesmen Problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3689142"}},"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":"Q3883900$4F13C2B3-D28B-4A66-8AB5-BD35391FF2AB","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"25a438431d40c51436797c2bf01b4eaa3e00a819","datavalue":{"value":{"text":"A Cutting Planes Algorithm for the m-Salesmen Problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q3883900$6A341E26-14C9-4948-AE2C-246C88926923","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b0f742dba303cb318a8339ff389e18fe6323f8df","datavalue":{"value":"0441.90067","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3883900$0C9BC2B5-5328-47DF-A637-AA6E17CA5289","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"244c71c943c788237f08c5a436d4a49c101567c2","datavalue":{"value":"10.2307/2581282","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3883900$B93DE5E6-E07B-4B95-B644-178EFD6A3469","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9bb4124699c1f5367e8eff90a7046d28f42f9fac","datavalue":{"value":{"entity-type":"item","numeric-id":203167,"id":"Q203167"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3883900$CF4D3624-9B4B-47E3-89B7-A9A5445FF243","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"fbe9f7fb37828186e04ddcd36a3bc70db0ecde3e","datavalue":{"value":{"entity-type":"item","numeric-id":1096549,"id":"Q1096549"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3883900$F40134E2-9842-4DDF-8D8A-DEA728807191","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a5f20380464b718d6886f6a6704990684b80e9ff","datavalue":{"value":{"entity-type":"item","numeric-id":3030552,"id":"Q3030552"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q3883900$17B49F54-DE22-4DBB-91EB-4FDD9DE3F45F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"56afe75e154439409929c71e0e459d1542811b6e","datavalue":{"value":{"time":"+1980-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":"Q3883900$133D926C-8020-4D68-9208-83281FD8FEDB","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"3feee98fb6a1a95642ba0c6a16390527874922bf","datavalue":{"value":"90C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3883900$BA262C24-5887-4A66-A4CE-E3A285FFFA1F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3883900$46866D1D-F6A4-4336-92DC-FBB5E1400C88","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"182ebdffbfbef015dc7981c027af79ceec732d81","datavalue":{"value":"3689142","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3883900$E6556697-B962-4848-9FCB-7B56EBE543D0","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"59ad6be8475048b5525e60047f5c7cd1e3b764b2","datavalue":{"value":"cutting planes algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q3883900$9BFCD3BC-C6E9-4BC5-87B8-0074177911ED","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"28da3a0e303236fdb43def135f5b2e780b21c9dc","datavalue":{"value":"m-salesmen problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q3883900$1E63DA35-6AF1-43E0-9BA1-924474F5246D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6e87618aee6343e13e99830120698ef319daa4c9","datavalue":{"value":"integer linear programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q3883900$F3F9C654-C610-4081-9EF3-DC5DD93DAC2A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0a98fdc415b871902bf310caee2992f6f1b91c39","datavalue":{"value":"travelling salesman problem","type":"string"},"datatype":"string"},"type":"statement","id":"Q3883900$10B89DE0-0727-4381-B138-497549B81F99","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f2547fe05fc38d862a3c0fa5dd3d72d33319bce3","datavalue":{"value":"computational experience","type":"string"},"datatype":"string"},"type":"statement","id":"Q3883900$E8C62765-D076-4906-AB09-9B39D1D898DB","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":"Q3883900$150B0F00-08C7-4DE4-A08E-30AADC3F82F5","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"56fb2f4d9bf5aef76213f62d19073329d1578653","datavalue":{"value":"https://doi.org/10.2307/2581282","type":"string"},"datatype":"url"},"type":"statement","id":"Q3883900$CB7350EE-63F0-4833-99D5-FA69C4B10464","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"7dd5f4a195774d75ed4a30609c1100aebf492cf4","datavalue":{"value":"W4234818164","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q3883900$ADDDB9F7-89CD-465B-8792-CC0BF840465B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Cutting Planes Algorithm for the m-Salesmen Problem","badges":[]}}}}}