AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Novel Approaches to Hard Discrete Optimization
About this Title
Panos Pardalos, University of Florida, Gainesville, FL and Henry Wolkowicz, University of Waterloo, Waterloo, ON, Canada, Editors
Publication: Fields Institute Communications
Publication Year:
2003; Volume 37
ISBNs: 978-0-8218-3248-6 (print); 978-1-4704-3071-9 (online)
DOI: https://doi.org/10.1090/fic/037
MathSciNet review: MR1987230
MSC: Primary 00B25; Secondary 68-06, 90-06
ReadershipTable of Contents
Download chapters as PDF
Front/Back Matter
Chapters
- Alexander Barvinok and Tamon Stephen – On the distribution of values in the quadratic assignment problem
- Vladimir Boginski, Sergiy Butenko and Panos Pardalos – Modeling and optimization in massive graphs
- Mihaela Cardei, Xiuzhen Cheng, Xiaoyan Cheng and Ding-Zhu Du – A tale on guillotine cut
- Maggie Cheng, Zhigang Gong, Xiao Huang, Hong Zhao, Xiaohua Jia and Deying Li – Wavelength assignment algorithms in multifiber networks
- Don Coppersmith and Jon Lee – Indivisibility and divisbility polytopes
- William Hager – The dual active set algorithm and the iterative solution of linear programs
- Christopher Hillar and Charles Johnson – Positive eigenvalues of generalized words in two Hermitian positive definite matrices
- Kartik Krishnan and John Mitchell – Semi-infinite linear programming approaches to semidefinite programming problems
- Jean Lasserre – SDP versus LP relaxations for polynomial programming
- Manki Min, Scott Huang, Jian Liu, Eugene Shragowitz, Weili Wu, Yiyuan Zhao and Ying Zhao – An approximation scheme for the rectilinear Steiner minimum tree in presence of obstructions
- Faranak Mokhtarian – A convex feasibility problem defined by a nonlinear separation oracle
- Guanglu Zhou, Jie Sun and Kim-Chuan Toh – Efficient algorithms for the smallest enclosing ball problem in high dimensional space