Shortcuts
Top of page (Alt+0)
Page content (Alt+9)
Page menu (Alt+8)
Your browser does not support javascript, some WebOpac functionallity will not be available.
.
Default
.
PageMenu
-
Main Menu
-
Simple Search
.
Advanced Search
.
Journal Search
.
Refine Search Results
.
Preferences
.
Search Menu
Simple Search
.
Advanced Search
.
New Items Search
.
Journal Search
.
Refine Search Results
.
Bottom Menu
Help
Italian
.
English
.
German
.
New Item Menu
New Items Search
.
New Items List
.
Links
SISSA Library
.
ICTP library
.
Italian National web catalog (SBN)
.
Trieste University web catalog
.
Udine University web catalog
.
© LIBERO v6.4.1sp220816
Page content
You are here
:
Catalogue Display
Catalogue Display
Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems /
.
Bookmark this Record
Catalogue Record 45146
.
.
LibraryThing
.
.
Google Books
.
.
Amazon Books
.
Catalogue Information
Catalogue Record 45146
.
Reviews
Catalogue Record 45146
.
British Library
Resolver for RSN-45146
Google Scholar
Resolver for RSN-45146
WorldCat
Resolver for RSN-45146
Catalogo Nazionale SBN
Resolver for RSN-45146
GoogleBooks
Resolver for RSN-45146
ICTP Library
Resolver for RSN-45146
.
Share Link
Jump to link
Catalogue Information
Field name
Details
Dewey Class
670
Title
Approximation and Complexity in Numerical Optimization ([EBook] :) : Continuous and Discrete Problems / / edited by Panos M. Pardalos.
Added Personal Name
Pardalos, Panos M.
editor.
Other name(s)
SpringerLink (Online service)
Publication
Boston, MA : : Springer US : : Imprint: Springer, , 2000.
Physical Details
XIV, 581 p. : online resource.
Series
Nonconvex Optimization and Its Applications
1571-568X ; ; 42
ISBN
9781475731453
Summary Note
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.:
Contents note
Navigating Graph Surfaces -- The Steiner Ratio of Lp-planes -- Hamiltonian Cycle Problem via Markov Chains and Min-type Approaches -- Solving Large Scale Uncapacitated Facility Location Problems -- A Branch — and — Bound Procedure for the Largest Clique in a Graph -- A New “Annealed” Heuristic for the Maximum Clique Problem -- Inapproximability of some Geometric and Quadratic Optimization Problems -- Convergence Rate of the P-Algorithm for Optimization of Continious Functions -- Application of Semidefinite Programming to Circuit Partitioning -- Combinatorial Problems Arising in Deregulated Electrical Power Industry: Survey and Future Directions -- On Approximating a Scheduling Problem -- Models and Solution for On-Demand Data Delivery Problems -- Complexity and Experimental Evaluation of Primal-Dual Shortest Path Tree Algorithms -- Machine Partitioning and Scheduling under Fault-Tolerance Constraints -- Finding Optimal Boolean Classifiers -- Tighter Bounds on the Performance of First Fit Bin Packing -- Block Exchange in Graph Partitioning -- On the Efficient Approximability of “HARD” Problems: A Survey -- Exceptional Family of Elements, Feasibility, Solvability and Continuous Paths of ?- Solutions for Nonlinear Complementarity Problems -- Linear Time Approximation Schemes for Shop Scheduling Problems -- On Complexity and Optimization in Emergent Computation -- Beyond Interval Systems: What Is Feasible and What Is Algorithmically Solvable? -- A Lagrangian Relaxation of the Capacitated Multi-Item Lot Sizing Problem Solved with an Interior Point Cutting Plane Algorithm -- An Approximate Algorithm For a Weapon Target Assignment Stochastic Program -- Continuous-based Heuristics for Graph and Tree Isomorphisms, with Application to Computer Vision -- Geometric Optimization Problems for Steiner Minimal Trees in E3 -- Optimization of a Simplified Fleet Assignment Problem with Metaheuristics: Simulated Annealing and GRASP -- Towards Implementations of Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems -- Piecewise Concavity and Discrete Approaches to Continuous Minimax Problems -- The MCCNF Problem with a Fixed Number of Nonlinear Arc Costs: Complexity and Approximation -- A New Parametrization Algorithm for the Linear Complementarity Problem -- Obtaining an Approximate Solution for Quadratic Maximization Problems.
System details note
Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
http://dx.doi.org/10.1007/978-1-4757-3145-3
Links to Related Works
Subject References:
Approximation theory
.
Approximations and Expansions
.
Calculus of variations
.
Calculus of variations and optimal control; optimization
.
Computers
.
Engineering
.
Industrial and Production Engineering
.
Industrial engineering
.
Production engineering
.
Theory of Computation
.
Authors:
Pardalos, Panos M.
.
Corporate Authors:
SpringerLink (Online service)
.
Series:
Nonconvex Optimization and Its Applications
.
Classification:
670
.
.
ISBD Display
Catalogue Record 45146
.
Tag Display
Catalogue Record 45146
.
Related Works
Catalogue Record 45146
.
Marc XML
Catalogue Record 45146
.
Add Title to Basket
Catalogue Record 45146
.
Catalogue Information 45146
Beginning of record
.
Catalogue Information 45146
Top of page
.
Download Title
Catalogue Record 45146
Export
This Record
As
Labelled Format
Bibliographic Format
ISBD Format
MARC Format
MARC Binary Format
MARCXML Format
User-Defined Format:
Title
Author
Series
Publication Details
Subject
To
File
Email
Reviews
This item has not been rated.
Add a Review and/or Rating
45146
1
45146
-
2
45146
-
3
45146
-
4
45146
-
5
45146
-
Quick Search
Search for