Nonconvex Optimization and Its Applications

Approximation and Complexity in Numerical Optimization

Continuous and Discrete Problems

Editors: Pardalos, Panos M. (Ed.)

Buy this book

eBook $269.00
price for USA (gross)
  • ISBN 978-1-4757-3145-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $339.00
price for USA
  • ISBN 978-0-7923-6275-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $339.00
price for USA
  • ISBN 978-1-4419-4829-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet­ ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap­ proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob­ lems, new approximate algorithms have been developed based on semidefinite pro­ gramming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri­ cal optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable. The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions. A conference on Approximation and Complexity in Numerical Optimization: Con­ tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida.

Table of contents (32 chapters)

  • Navigating Graph Surfaces

    Abello, James (et al.)

    Pages 1-16

  • The Steiner Ratio of L p -planes

    Albrecht, Jens (et al.)

    Pages 17-30

  • Hamiltonian Cycle Problem via Markov Chains and Min-type Approaches

    Andramonov, Mikhail (et al.)

    Pages 31-47

  • Solving Large Scale Uncapacitated Facility Location Problems

    Barahona, Francisco (et al.)

    Pages 48-62

  • A Branch-and-Bound Procedure for the Largest Clique in a Graph

    Barnes, Earl R.

    Pages 63-77

Buy this book

eBook $269.00
price for USA (gross)
  • ISBN 978-1-4757-3145-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $339.00
price for USA
  • ISBN 978-0-7923-6275-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $339.00
price for USA
  • ISBN 978-1-4419-4829-8
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Approximation and Complexity in Numerical Optimization
Book Subtitle
Continuous and Discrete Problems
Editors
  • Panos M. Pardalos
Series Title
Nonconvex Optimization and Its Applications
Series Volume
42
Copyright
2000
Publisher
Springer US
Copyright Holder
The Editor(s) (if applicable) and The Author(s) 2018
eBook ISBN
978-1-4757-3145-3
DOI
10.1007/978-1-4757-3145-3
Hardcover ISBN
978-0-7923-6275-3
Softcover ISBN
978-1-4419-4829-8
Series ISSN
1571-568X
Edition Number
1
Number of Pages
XIV, 581
Topics