Approximation and Complexity in Numerical Optimization Continuous and Discrete Problems
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 continuo...
| Other Authors: | |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY
Springer US
2000, 2000
|
| Edition: | 1st ed. 2000 |
| Series: | Nonconvex Optimization and Its Applications
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- 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 forSteiner 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