Novel Approaches to Hard Discrete Optimization

Front Cover
Panos M. Pardalos, Henry Wolkowicz
American Mathematical Soc. - Mathematics - 181 pages
0 Reviews
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Modeling and Optimi2ation in Massive Graphs
17
A Tale on Guillotine Cut
41
Wavelength Assigmnent Algorithms in Multifiber Networks
55
Indivisibility and Divisibility Polytopes
71
The Dual Active Set Algorithm and the Iterative Solution
97
Positive Eigenvalues of Generali2ed Words
111
SDP Versus LP Relaxations for Polynomial Programming
143
A Convex Feasibility Problem Defined by a Nonlinear Separation Oracle
165
Copyright

Common terms and phrases

Bibliographic information