Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems / Edition 1

Hardcover (Print)
Buy New
Buy New from
Used and New from Other Sellers
Used and New from Other Sellers
from $110.79
Usually ships in 1-2 business days
(Save 64%)
Other sellers (Hardcover)
  • All (6) from $110.79   
  • New (5) from $110.79   
  • Used (1) from $370.77   


The main focus of complexity is the study of whether existing algorith ms 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 prob lems, and reveals surprising connections among problems and their solu tions. The two themes of approximation and complexity pervade this boo k.

Read More Show Less

Product Details

Table of Contents

Preface. 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.
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Terms of Use.
  • - Barnes & reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)