{"entities":{"Q7329912":{"pageid":31386313,"ns":120,"title":"Item:Q7329912","lastrevid":107842973,"modified":"2026-10-27T12:48:13Z","type":"item","id":"Q7329912","labels":{"en":{"language":"en","value":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem"}},"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":"Q7329912$96F961C5-9C05-47C4-8B88-CA066ACE64DE","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":"Q7329912$188AC81E-77C3-4C36-A4BE-576A76F49437","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"5a39cf89bb462547f59a957e9a7e01c3572b81b6","datavalue":{"value":"2607.00611","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7329912$93A144E4-3718-4960-A818-0D690999024A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"b9a9f083f16b4d560f528b249fe0e875d7e0822f","datavalue":{"value":{"entity-type":"item","numeric-id":6878547,"id":"Q6878547"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7329912$872C69BF-45C1-46F4-ACC4-77B7597A54F3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ad47c3f41a1cd267a1805eeea9525241992797cb","datavalue":{"value":{"entity-type":"item","numeric-id":2029004,"id":"Q2029004"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7329912$1C3DA6E9-EC5E-4855-88FC-9A2D2E1A65CC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"60708150ceb8ecdac9fda6d4de491c336e409860","datavalue":{"value":{"entity-type":"item","numeric-id":323203,"id":"Q323203"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7329912$F343C159-ADFB-4BC0-8B03-E39CE15DA8F2","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":"Q7329912$8A2E9A1A-125F-4C2C-BC29-531E8D151686","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":"Q7329912$1157D0DD-B96D-453C-86B5-09B592D30A13","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An semidefinite programming-based $\\varepsilon$-constraint method for the bi-objective single-row facility layout problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_semidefinite_programming-based_$%5Cvarepsilon$-constraint_method_for_the_bi-objective_single-row_facility_layout_problem"}}}}}