{"entities":{"Q1149254":{"pageid":1160003,"ns":120,"title":"Item:Q1149254","lastrevid":69741555,"modified":"2026-04-13T09:05:08Z","type":"item","id":"Q1149254","labels":{"en":{"language":"en","value":"Parametric shortest path algorithms with an application to cyclic staffing"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 3709595"}},"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":"Q1149254$7C7AE061-A2FE-4414-8A3B-9D98C58CF9E0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"9c1dc6913d9982f2df30b6dc99669ce3acf9920f","datavalue":{"value":{"text":"Parametric shortest path algorithms with an application to cyclic staffing","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1149254$28E25121-AF48-4ED4-AD9A-7D7CB8A0709A","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"7518672f5472910e01ea32111a3f14e201bafeec","datavalue":{"value":"0453.68032","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1149254$64A28A6C-55BF-4695-A3CA-5A39E9D669FB","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"2cf5def1ee5ca30249436264037edf66198aa603","datavalue":{"value":"10.1016/0166-218X(81)90026-3","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1149254$0867D727-2A1F-4C22-ABBD-CB14B6FC12CE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d7f03cf6abbdf2fe79063aacbf005af333537b97","datavalue":{"value":{"entity-type":"item","numeric-id":619905,"id":"Q619905"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1149254$5AB5ABA2-CBE0-4C15-9A9D-8521EAAB40DF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"66a05d3cec73c611e907f1d401669479dd6ceb7b","datavalue":{"value":{"entity-type":"item","numeric-id":229627,"id":"Q229627"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1149254$31D4B870-26DF-40CD-8046-789F1DDF9934","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"087f55844cc920aae060b09644168bf17b022e1a","datavalue":{"value":{"entity-type":"item","numeric-id":96294,"id":"Q96294"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1149254$74261230-0A68-401A-AFEB-5D32B68DDAD4","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"50fad0db7dc87cb4e51866acdb5ccbaa54ec857b","datavalue":{"value":{"time":"+1981-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":"Q1149254$792C8549-A342-4043-B3A2-ABAA90A550D6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"344f62a15ccd40e690364bd758985e8313f47f4a","datavalue":{"value":"68R10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1149254$F3208B9E-B964-43AE-ADBD-242283493A30","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"f3a5e47548ef139717b317f83801cfef606a623d","datavalue":{"value":"05C38","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1149254$74991C29-275F-4441-BF6A-5D0403923C62","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d955e7681df8a6877c0468d99d93535d0bc909bf","datavalue":{"value":"3709595","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1149254$F22906FD-4A2D-4266-B47F-2FFB24B1B015","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"73027cba1a78d2b81c3e5b159f6527f176ebaf13","datavalue":{"value":"parametric programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1149254$0B1618E4-E0D2-413C-AB42-75839E054193","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"8693c1bd63091cc68a785e1b63ddb4ee54ed3484","datavalue":{"value":"Q59592772","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1149254$EDF05F51-715D-461C-A58B-26673D6FC21C","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":"Q1149254$53DF48DB-99BB-4E5D-98DE-BC3ED5528F9C","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"ebd815db2d3fdcb48404996beb02055ae060e18a","datavalue":{"value":{"entity-type":"item","numeric-id":3898330,"id":"Q3898330"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1149254$8D73D0A5-7022-43CC-BEB7-0C8A0855F9A5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"f970782cef7606d75b439e57c5964589154083b2","datavalue":{"value":{"entity-type":"item","numeric-id":1249587,"id":"Q1249587"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1149254$AB90014F-B098-4733-B498-C911CB552304","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"dc6482fda869c7df0ed32fd6ade8f790a1ff04cc","datavalue":{"value":{"entity-type":"item","numeric-id":5585020,"id":"Q5585020"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1149254$27B8DDC7-E986-44B5-BCCC-CEAB70AE2366","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Parametric shortest path algorithms with an application to cyclic staffing","badges":[]}}}}}