Combinatorial And Global Optimization
eBook - PDF

Combinatorial And Global Optimization

  1. 372 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF

Combinatorial And Global Optimization

About this book

Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated Goemans-Williamson relaxation of the maximum cut problem, and the Du-Hwang solution of the Gilbert-Pollak conjecture. Since integer constraints are equivalent to nonconvex constraints, the fundamental difference between classes of optimization problems is not between discrete and continuous problems but between convex and nonconvex optimization problems. This volume is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete, Greece.

Frequently asked questions

Yes, you can cancel anytime from the Subscription tab in your account settings on the Perlego website. Your subscription will stay active until the end of your current billing period. Learn how to cancel your subscription.
No, books cannot be downloaded as external files, such as PDFs, for use outside of Perlego. However, you can download books within the Perlego app for offline reading on mobile or tablet. Learn more here.
Perlego offers two plans: Essential and Complete
  • Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
  • Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Both plans are available with monthly, semester, or annual billing cycles.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes! You can use the Perlego app on both iOS or Android devices to read anytime, anywhere — even offline. Perfect for commutes or when you’re on the go.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Yes, you can access Combinatorial And Global Optimization by Rainer E Burkard, Athanasios Migdalas, Panos M Pardalos in PDF and/or ePUB format, as well as other popular books in Mathematics & Applied Mathematics. We have over one million books available in our catalogue for you to explore.

Table of contents

  1. Contents
  2. Preface
  3. A Forest Exterior Point Algorithm for Assignment Problems
  4. A Hybrid Scatter Genetic Tabu Approach for Continuous Global Optimization
  5. Exact Rates of Prokhorov Convergence under Three Moment Conditions
  6. Location/Allocation of Queuing Facilities in Continuous Space using Minisum and Minimax Criteria
  7. Algorithms for the Consistency Analysis in Scenario Projects
  8. Assignment of Reusable and Non-Reusable Frequencies
  9. Image Space Analysis for Vector Optimization and Variational Inequalities. Scalarization
  10. Solving Quadratic Knapsack Problems by Reformulation and Tabu Search. Single Constraint Case
  11. Global Optimization using Dynamic Search Trajectories
  12. On Pareto Efficiency. A General Constructive Existence Principle
  13. Piecewise Linear Network Flow Problems
  14. Semidefinite Programming Approaches for MAX-2-SAT and MAX-3-SAT: computational perspectives
  15. On a Data Structure in a Global Description of Sequences
  16. Heuristic Solutions of Vehicle Routing Problems in Supply Chain Management
  17. A New Finite Cone Covering Algorithm for Concave Minimization
  18. A Diagonal Global Optimization Method
  19. Frequency Assignment for Very Large Sparse Networks
  20. A Derivative Free Minimization Method for Noisy Functions
  21. Tight QAP Bounds via Linear Programming
  22. GPS Network Design: An Application of the Simulated Annealing Heuristic Technique
  23. Global Optimization for Crack Identification:Impact-Echo Experiments
  24. Normal Branch and Bound Algorithms for General Nonconvex Quadratic Programming