Approximation and complexity in numerical optimization : continuous and discrete problems /
Saved in:
| Other Authors: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Dordrecht [Netherlands] ; Boston :
Kluwer Academic Publishers,
2000.
|
| Series: | Nonconvex optimization and its applications ;
v.42 |
| Subjects: | |
| Online Access: | Table of contents only Publisher description |
| LEADER | 04805cam a2200481 a 4500 | ||
|---|---|---|---|
| 001 | c000402732 | ||
| 003 | CARM | ||
| 005 | 20190322100310.0 | ||
| 006 | m d | ||
| 008 | 190322s2000 enka 100 0 eng | ||
| 010 | |a 00029607 | ||
| 015 | |a GBA0-44274 |2 bnb | ||
| 019 | 1 | |a 69841951 |5 LACONCORD2021 | |
| 020 | |a 0792362756 | ||
| 035 | |a (OCoLC)43648692 |5 LACONCORD2021 | ||
| 040 | |a DLC |b eng |c DLC |d Uk | ||
| 042 | |a pcc | ||
| 050 | 0 | 0 | |a QA402.5 |b .A648 2000 |
| 082 | 0 | 4 | |a 519.3 |2 21 |
| 084 | |a PA 198 |2 blsrissc | ||
| 245 | 0 | 0 | |a Approximation and complexity in numerical optimization : |b continuous and discrete problems / |c edited by Panos M. Pardalos. |
| 260 | |a Dordrecht [Netherlands] ; |a Boston : |b Kluwer Academic Publishers, |c 2000. | ||
| 300 | |a xiv, 577 p. : |b ill. ; |c 25 cm. | ||
| 490 | 1 | |a Nonconvex optimization and its applications ; |v v.42 | |
| 500 | |a Conference proceedings. | ||
| 504 | |a Includes bibliographical references. | ||
| 505 | 0 | 0 | |a Machine derived contents note: 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. |
| 505 | 0 | 0 | |a 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. |
| 505 | 0 | 0 | |a 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 Stochastic 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. |
| 505 | 0 | 0 | |a Obtaining an Approximate Solution for Quadratic Maximization Problems; Y. Yajima. |
| 650 | 0 | |a Mathematical optimization |v Congresses. | |
| 650 | 0 | |a Approximation theory |v Congresses. | |
| 650 | 0 | |a Computational complexity |v Congresses. | |
| 700 | 1 | |a Pardalos, P. M. | |
| 852 | 8 | |b CARM |i C13759 |p 0653050 |f BK | |
| 852 | 8 | |b SCAN |h A3:AG07G0 |i C13759 |p 0653050 |f BK | |
| 852 | 8 | |b SCAN |h A3:AG07G0 |i C13759 |p 0653050 |f BK | |
| 830 | 0 | |a Nonconvex optimization and its applications ; |v v.42 | |
| 856 | 4 | 1 | |3 Table of contents only |u http://www.loc.gov/catdir/enhancements/fy0822/00029607-t.html |
| 856 | 4 | 2 | |3 Publisher description |u http://www.loc.gov/catdir/enhancements/fy0822/00029607-d.html |
| 999 | f | f | |i 6959c59d-f9d7-5a46-9a5c-ab92859d950f |s 637fb3b1-b0fb-539e-a150-0e693eee8258 |
| 952 | f | f | |p Can circulate |a CAVAL |b CAVAL |c CAVAL |d CARM 1 Store |e C13759 |h Other scheme |i book |m 0653050 |
| 952 | f | f | |a CAVAL |b CAVAL |c CAVAL |d Unmapped Location |e C13759 |f A3:AG07G0 |h Other scheme |