+612 9045 4394
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Minimax and Applications : Nonconvex Optimization and Its Applications - Ding-Zhu Du

Minimax and Applications

Nonconvex Optimization and Its Applications

By: Ding-Zhu Du (Editor), Panos M. Pardalos (Editor)

Hardcover Published: December 2009
ISBN: 9780792336150
Number Of Pages: 296

Share This Book:


or 4 easy payments of $84.72 with Learn more
Ships in 10 to 15 business days

Earn 678 Qantas Points
on this Book

Other Available Editions (Hide)

  • Paperback View Product Published: 14th October 2011

Classical minimax theory (von Neumann), duality and saddle point analysis have together played a critical role in optimization and game theory. It is currently recognised that minimax problems and techniques appear throughout a broad spectrum of disciplines, including game theory, optimization, and computational complexity. Many interesting and sophisticated problems are formulated as minimax applications, as in the fields of combinatorial optimization, scheduling, location, packing, searching, and triangulation. The contributions to Minimax and Applications cover a wide range of topics and provide an excellent picture of recent research and developments in minimax theory. Audience: Accessible to graduate students as well as researchers in optimization, computer science, and related areas.

Industry Reviews

` ... a valuable book carefully written in a clear and concise fashion. The survey papers give coherent and inspiring accounts ... coverage of algorithmic and applied topics ... is impressive. Both graduate students and researchers in fields such as optimization, computer science, production management, operations research and related areas will find this book to be an excellent source for learning about both classic and more recent developments in minimax and its applications. The editors are to be commended for their work in gathering these papers together.'
Journal of Global Optimization, 11 (1997)

Minimax Theorems and Their Proofsp. 1
A Survey on Minimax Trees and Associated Algorithmsp. 25
An Iterative Method for the Minimax Problemp. 55
A Dual and Interior Point Approach to Solve Convex Min-Max Problemsp. 69
Determining the Performance Ratio of Algorithm MULTIFIT for Schedulingp. 79
A Study of On-Line Scheduling Two-Stage Shopsp. 97
Maxmin Formulation of the Apportionments of Seats to a Parliamentp. 109
On Shortest k-Edge Connected Steiner Networks with Rectilinear Distancep. 119
Mutually Repellant Samplingp. 129
Geometry and Local Optimality Conditions for Bilevel Programs with Quadratic Strictly Convex Lower Levelsp. 141
The Spherical One-Center Problemp. 153
On Min-max Optimization of a Collection of Classical Discrete Optimization Problemsp. 157
Heilbronn Problem for Six Points in a Planar Convex Bodyp. 173
Heilbronn Problem for Seven Points in a Planar Convex Bodyp. 191
On the Complexity of Min-Max Optimization Problems and Their Approximationp. 219
A Competitive Algorithm for the Counterfeit Coin Problemp. 241
A Minimax [alpha][beta] Relaxation for Global Optimizationp. 251
Minimax Problems in Combinatorial Optimizationp. 269
Author Indexp. 293
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9780792336150
ISBN-10: 0792336151
Series: Nonconvex Optimization and Its Applications
Audience: General
Format: Hardcover
Language: English
Number Of Pages: 296
Published: December 2009
Country of Publication: NL
Dimensions (cm): 23.39 x 15.6  x 1.91
Weight (kg): 0.61

Earn 678 Qantas Points
on this Book