Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems / Edition 1by Panos M. Pardalos
Pub. Date: 05/31/2000
Publisher: Springer US
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… See more details below
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.
- Springer US
- Publication date:
- Nonconvex Optimization and Its Applications (closed) Series, #42
- Edition description:
- Product dimensions:
- 7.30(w) x 9.16(h) x 1.40(d)
Table of ContentsPreface. Navigating Graph Surfaces; J. Abello, S. Krishnan. The Steiner Ratio of Lp-planes; J. Albrecht, D. Cieslik. Hamiltonian Cycle Problem via Markov Chains and Min-type Approaches; M. Andramonov, et al. Solving Large Scale Uncapacitated Facility Location Problems; F. Barahona, F. Chudak. A Branch - and - Bound Procedure for the Largest Clique in a Graph; E.R. Barnes. A New 'Annealed' Heuristic for the Maximum Clique Problem; I.M. Bomze, et al. Inapproximability of some Geometric and Quadratic Optimization Problems; A. Brieden, et al. Convergence Rate of the P-Algorithm for Optimization of Continious Functions; J.M. Calvin. Application of Semidefinite Programming to Circuit Partitioning; C.C. Choi, Y. Ye. Combinatorial Problems Arising in Deregulated Electrical Power Industry: Survey and Future Directions; D. Cook, et al. On Approximating a Scheduling Problem; P. Crescenzi, et al. Models and Solution for On-Demand Data Delivery Problems; M.C. Ferris, R.R. Meyer. Complexity and Experimental Evaluation of Primal-Dual Shortest Path Tree Algorithms; P. Festa, et al. Machine Partitioning and Scheduling under Fault-Tolerance Constraints; D.A. Fotakis, P.G. Spirakis. Finding Optimal Boolean Classifiers; J. Franco. Tighter Bounds on the Performance of First Fit Bin Packing; M. Fürer. Block Exchange in Graph Partitioning; W.W. Hager, et al. On the Efficient Approximability of 'HARD' Problems; A Survey; H.B. Hunt III, et al. Exceptional Family of Elements, Feasibility, Solvability and Continuous Paths of epsilon-Solutions for Nonlinear Complementarity Problems; G. Isac. Linear Time Approximation Schemes for Shop Scheduling Problems; K. Jansen, et al. On Complexity and Optimization in Emergent Computation; V. Korotkich. Beyond Interval Systems: What Is Feasible and What Is Algorithmically Solvable? V. Kreinovich. A Lagrangian Relaxation of the Capacitated Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plante Algorithm; O. du Merle, et al. An Approximate Algorithm For a Weapon Target Assignment Shastic Program; R.A. Murphey. Continuous-based Heuristics for Graph and Tree Isomorphisms, with Application to Computer Vision; M. Pelillo, et al. Geometric Optimization Problems for Steiner Minimal Trees in E3; J. MacGregor Smith. Optimization of a Simplified Assignment Problem with Metaheuristics: Simulated Annealing and GRASP; D. Sosnowska. Towards Implementations of Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems; A. Takeda, et al. Piecewise Concavity and Discrete Approaches to Continuous Minimax Problems; F. Tardella. The MCCNF Problem with a Fixed Number of Nonlinear Arc Costs: Complexity and Approximation; H. Tuy. A New Parametrization Algorithm for the Linear Complementarity Problem; S. Verma, et al. Obtaining an Approximate Solution for Quadratic Maximization Problems; Y. Yajima.
and post it to your social network
Most Helpful Customer Reviews
See all customer reviews >