{"entities":{"Q7220932":{"pageid":22309637,"ns":120,"title":"Item:Q7220932","lastrevid":107677460,"modified":"2026-10-27T11:35:41Z","type":"item","id":"Q7220932","labels":{"en":{"language":"en","value":"Solution of a bilevel optimistic scheduling problem on parallel machines"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q7220932$BBD64B8B-70DE-4DF3-BA3C-A690B818E582","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fea8258efc0c807aa3a84f12ebcd68838427a662","datavalue":{"value":{"time":"+2026-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":"Q7220932$3234ED4E-CFF6-4196-944C-4818C800DF73","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"6cc7ecf737bf0c9732f7dd0e8629f22892de2212","datavalue":{"value":"2603.05107","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7220932$CC2C8725-A9CD-4AEF-8603-44969F7B1AAE","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"3c4caef08ddb28fe93245946a850250db0f3bda6","datavalue":{"value":{"entity-type":"item","numeric-id":7206969,"id":"Q7206969"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7220932$733A32EF-6BA9-4B71-8E39-A1A742C4B1FD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"cbcf00303ce5d09bee722ba5bceba41309351e80","datavalue":{"value":{"entity-type":"item","numeric-id":2242050,"id":"Q2242050"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7220932$1F8220A6-E762-452F-A0A5-0F8C1C14BA76","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f58eca313744a3651541b173ee43e71aaf4ed744","datavalue":{"value":{"entity-type":"item","numeric-id":309070,"id":"Q309070"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7220932$A0C6710E-EC10-4C58-B73E-159DDE9CB285","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"0eeb9005f15747f7691d1f0f8c3da9f051f98145","datavalue":{"value":{"entity-type":"item","numeric-id":161973,"id":"Q161973"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7220932$0DE2E218-DC7B-43E7-8E5F-65B9863CEE84","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5aa695e48f2bb4b9cb74c54c4de1297e770c09b4","datavalue":{"value":{"entity-type":"item","numeric-id":1592282,"id":"Q1592282"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7220932$350A739A-A1C9-4C74-ACA8-2F767B504571","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"67a4164a753d77c30f00f482ec873e458a32d605","datavalue":{"value":{"entity-type":"item","numeric-id":7220931,"id":"Q7220931"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7220932$E3DEC37F-97CC-499E-A368-79FE2489B468","rank":"normal"}],"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":"Q7220932$68758BAD-B613-4953-86E8-C4613E6DAE40","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":"Q7220932$DACD418C-E4F1-4F48-A233-F4700933FED6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Solution of a bilevel optimistic scheduling problem on parallel machines","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Solution_of_a_bilevel_optimistic_scheduling_problem_on_parallel_machines"}}}}}