Combinatorial and Global Optimization - Hardcover

Burkard, R.E.

Hardcover

ISBN 10: 9810248024 ISBN 13: 9789810248024

Publisher: World Scientific Publishing Company, 2002

Synopsis

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.

Edition details

• Publisher: World Scientific Publishing Company
• Publication date: 2002
• ISBN 10: 9810248024
• ISBN 13: 9789810248024
• Binding: Hardcover
• Language: English
• Edition number: 1
• Number of pages: 370
• Editor: Pardalos Panos M., Migdalas Athanasios, Burkard Rainer E.