Novel approaches to hard discrete optimization (Q1812247)

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]