Computational complexity, originated from the interactions between computer science and numerical optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty. This volume is a collection of articles on recent complexity developments in numerical optimization. The topics covered include complexity of approximation algorithms, new polynomial time algorithms for convex quadratic minimization, interior point algorithms, complexity issues regarding test generation of NP-hard problems, complexity of scheduling problems, min-max, fractional combinatorial optimization, fixed point computations, and network flow problems. This volume should be a valuable source of information to faculty, students and researchers in numerical optimization and related areas.
FREE Two-Day Shipping for students on millions of items. Learn more |
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
This paper continues a series of recent works regarding the average complexity of interior point algorithms for linear programming (LP). Read the first page Key Phrases - Capitalized Phrases (CAPs): (learn more)
Management Science, Rinnooy Kan, New York, Numerical Optimization, University of Florida, Van Wassenhove, European Journal of Operational Research, Iowa City, Naval Research Logistics Quarterly, University of Iowa, Department of Computer Science, Research Report, Subset Sum, Journal of Computing, Modified Even-Odd Partition, Annals of Discrete Mathematics, Department of Mathematics, Discrete Algorithms, Academic Press, Computer Science Department, Cornell University, Lecture Notes, University of Texas, Annual Symposium, Information Processing Letters New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Front Flap | Table of Contents | First Pages | Back Flap | Back Cover | Surprise Me!
This paper continues a series of recent works regarding the average complexity of interior point algorithms for linear programming (LP). Read the first page Key Phrases - Capitalized Phrases (CAPs): (learn more)
Management Science, Rinnooy Kan, New York, Numerical Optimization, University of Florida, Van Wassenhove, European Journal of Operational Research, Iowa City, Naval Research Logistics Quarterly, University of Iowa, Department of Computer Science, Research Report, Subset Sum, Journal of Computing, Modified Even-Odd Partition, Annals of Discrete Mathematics, Department of Mathematics, Discrete Algorithms, Academic Press, Computer Science Department, Cornell University, Lecture Notes, University of Texas, Annual Symposium, Information Processing Letters New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Front Flap | Table of Contents | First Pages | Back Flap | Back Cover | Surprise Me!
Citations (learn more)
This book cites 60
books:
See all 60 books this book cites
48
books
cite this book:
See all 48 books citing this book
- Management Science by Laurence Moore on 5 pages
- Recent Advances in Global Optimization (Princeton Series in Computer Sciences) by Christodoulos A. Floudas on 4 pages
- Problem Complexity and Method Efficiency in Optimization (Wiley-Interscience Series in Discrete Mathematics) by A.S. Nemirovsky on 4 pages
- Combinatorial Optimization: Annotated Bibliographies by M. O'Heigeartaigh on page 243, page 297, and page 404
- Handbook Of Genetic Algorithms by Lawrence David Davis on page 235, page 251, and page 253
See all 60 books this book cites
- Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems (Nonconvex Optimization and Its Applications (closed)) by Panos M. Pardalos on 35 pages
- Introduction to Global Optimization (Nonconvex Optimization and Its Applications (closed)) by R. Horst on 4 pages
- Introduction to Global Optimization (Nonconvex Optimization and Its Applications (closed)) by R. Horst on page 306, Back Matter (1), and Back Matter (2)
- Minimax and Applications (Nonconvex Optimization and Its Applications (closed)) by Ding-Zhu Du on page 118, page 171, and page 289
- Recent Developments in Cooperative Control and Optimization (Cooperative Systems) by Sergiy Butenko on page 116, and page 241
See all 48 books citing this book
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
