Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Novel Approaches to Hard Discrete Optimization
 
Edited by: Panos Pardalos University of Florida, Gainesville, FL
Henry Wolkowicz University of Waterloo, Waterloo, ON, Canada
A co-publication of the AMS and Fields Institute
Novel Approaches to Hard Discrete Optimization
Hardcover ISBN:  978-0-8218-3248-6
Product Code:  FIC/37
List Price: $81.00
MAA Member Price: $72.90
AMS Member Price: $64.80
eBook ISBN:  978-1-4704-3071-9
Product Code:  FIC/37.E
List Price: $76.00
MAA Member Price: $68.40
AMS Member Price: $60.80
Hardcover ISBN:  978-0-8218-3248-6
eBook: ISBN:  978-1-4704-3071-9
Product Code:  FIC/37.B
List Price: $157.00 $119.00
MAA Member Price: $141.30 $107.10
AMS Member Price: $125.60 $95.20
Novel Approaches to Hard Discrete Optimization
Click above image for expanded view
Novel Approaches to Hard Discrete Optimization
Edited by: Panos Pardalos University of Florida, Gainesville, FL
Henry Wolkowicz University of Waterloo, Waterloo, ON, Canada
A co-publication of the AMS and Fields Institute
Hardcover ISBN:  978-0-8218-3248-6
Product Code:  FIC/37
List Price: $81.00
MAA Member Price: $72.90
AMS Member Price: $64.80
eBook ISBN:  978-1-4704-3071-9
Product Code:  FIC/37.E
List Price: $76.00
MAA Member Price: $68.40
AMS Member Price: $60.80
Hardcover ISBN:  978-0-8218-3248-6
eBook ISBN:  978-1-4704-3071-9
Product Code:  FIC/37.B
List Price: $157.00 $119.00
MAA Member Price: $141.30 $107.10
AMS Member Price: $125.60 $95.20
  • Book Details
     
     
    Fields Institute Communications
    Volume: 372003; 181 pp
    MSC: Primary 90;

    During the last decade, many novel approaches have been considered for dealing with computationally difficult discrete optimization problems. Such approaches include interior point methods, semidefinite programming techniques, and global optimization. More efficient computational algorithms have been developed and larger problem instances of hard discrete problems have been solved. This progress is due in part to these novel approaches, but also to new computing facilities and massive parallelism.

    This volume contains the papers presented at the workshop on “Novel Approaches to Hard Discrete Optimization”. The articles cover a spectrum of issues regarding computationally hard discrete problems.

    Titles in this series are co-published with the Fields Institute for Research in Mathematical Sciences (Toronto, Ontario, Canada).

    Readership

    Graduate students and research mathematicians interested in theoretical and computational aspects of optimization.

  • Table of Contents
     
     
    • 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
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
Volume: 372003; 181 pp
MSC: Primary 90;

During the last decade, many novel approaches have been considered for dealing with computationally difficult discrete optimization problems. Such approaches include interior point methods, semidefinite programming techniques, and global optimization. More efficient computational algorithms have been developed and larger problem instances of hard discrete problems have been solved. This progress is due in part to these novel approaches, but also to new computing facilities and massive parallelism.

This volume contains the papers presented at the workshop on “Novel Approaches to Hard Discrete Optimization”. The articles cover a spectrum of issues regarding computationally hard discrete problems.

Titles in this series are co-published with the Fields Institute for Research in Mathematical Sciences (Toronto, Ontario, Canada).

Readership

Graduate students and research mathematicians interested in theoretical and computational aspects of optimization.

  • 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
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.