{"entities":{"Q1812247":{"pageid":1822989,"ns":120,"title":"Item:Q1812247","lastrevid":73014720,"modified":"2026-04-14T09:23:48Z","type":"item","id":"Q1812247","labels":{"en":{"language":"en","value":"Novel approaches to hard discrete optimization"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1932061"}},"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":"Q1812247$AE165CDD-EE33-4A10-A9B6-0F7A209FE708","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"a450bca917737a217a9dfc8ee46fa367f98f7b4d","datavalue":{"value":{"text":"Novel approaches to hard discrete optimization","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1812247$F7462713-4A8E-4E95-B401-13DEDEF99078","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"85004e1040fe48426da399c0f233396584d9711a","datavalue":{"value":"1013.00014","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1812247$54BB5C42-C475-483A-8A8E-F6EE108088CD","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"2df23fd836674182f6abb8aa06ce9dfaae0a35f4","datavalue":{"value":{"entity-type":"item","numeric-id":175353,"id":"Q175353"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1812247$5D5E6EA1-0962-4B7C-8B56-A6B206FCEC6A","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ef3076045f0e8eba82c71839f1400eb924a21432","datavalue":{"value":{"time":"+2003-06-22T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1812247$98131D98-9C1C-464B-9CFB-E705884FC1CE","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"af71d4d506e5e7b473bbf3ba5a5496eebce44ac4","datavalue":{"value":"The articles of this volume will be reviewed individually.  Indexed articles:  \\textit{Barvinok, Alexander; Stephen, Tamon}, On the distribution of values in the quadratic assignment problem, 1-16 [Zbl 1073.90033]  \\textit{Boginski, Vladimir; Butenko, Sergiv; Pardalos, Panos M.}, Modeling and optimization in massive graphs, 17-39 [Zbl 1034.68061]  \\textit{Cardei, Mihaela; Cheng, Xiuzhen; Cheng, Xiaoyan; Du, Ding-Zhu}, A tale on Guillotine cut, 41-54 [Zbl 1034.68041]  \\textit{Cheng, Maggie Xiaoyan; Gong, Zhigang; Huang, Xiao; Zhao, Hong G.; Jia, Xiaohua; Li, Deying}, Wavelength assigment algorithms in multifiber networks, 55-69 [Zbl 1048.90136]  \\textit{Coppersmith, Don; Lee, Jon}, Indivisibility and divisibility polytopes, 71-95 [Zbl 1107.90042]  \\textit{Hager, William W.}, The dual active set algorithm and the iterative solution of linear programs, 97-109 [Zbl 1176.90398]  \\textit{Hillar, Christopher J.; Johnson, Charles R.}, Positive eigenvalue of generalized words in two Hermitian positive definite matrices, 111-122 [Zbl 1027.15014]  \\textit{Krishnan, Kartik; Mitchell, John E.}, Semi-infinite linear programming approaches to semidefinite programming problems, 123-142 [Zbl 1028.65066]  \\textit{Lasserre, Jean B.}, SDP versus LP relaxations for polynomial programming, 143-154 [Zbl 1074.90027]  \\textit{Min, Manki; Huang, Scott C.-H.; Liu, Jian; Shragowitz, Eugene; Wu, Weili; Zhao, Yiyuan; Zhao, Ying}, An approximation scheme for the rectilinear Steiner minimum tree in presence of obstructions, 155-164 [Zbl 1034.68123]  \\textit{Sharifi Mokhtarian, Faranak}, A convex feasibility problem defined by a nonlinear separation oracle, 165-172 [Zbl 1105.90347]  \\textit{Zhou, Guanglu; Sun, Jie; Toh, Kim-Chuan}, Efficient algorithms for the smallest enclosing ball problem in high dimensional space, 173-181 [Zbl 1048.90155]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1812247$5F8BB2DA-9CB3-4E2D-BADA-4CAB3D2AFB68","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"342a6161f41187e2c595daa41b09cee10ab1ace9","datavalue":{"value":"00B15","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1812247$11F16061-A6A9-498F-BD26-F14B75A90256","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ecbbf3779c517fef97ab936b0a129d7ef035b583","datavalue":{"value":"90-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1812247$8E9686E1-E14F-40D9-964C-08E269C5E082","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"036f0c3283b5d898c0d926f521411c55cc99cd36","datavalue":{"value":"1932061","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1812247$1E7D5C9B-3B35-40E4-A4B6-E59A6426D325","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"42fd15c5ec69b758e158fc2489c6ec9386dd7775","datavalue":{"value":"Hard discrete optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1812247$93FAC299-C273-499A-A1AF-3896B3B12465","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":"Q1812247$3632B883-6912-4F10-B6DB-4DFF1238FB1B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Novel approaches to hard discrete optimization","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Novel_approaches_to_hard_discrete_optimization"}}}}}