Results 261 to 270 of about 36,965 (299)

Combinatorial Approximation Algorithms Guaranteed Versus Experimental Performance.

Vredeveld, Tjark
core  

Worst-case performance of approximation algorithms for tool management problems.

Klundert, Joris van de, Crama, Yves
core  

Experimental comparison of approximation algorithms for scheduling unrelated parallel machines.

Hurkens, Cor, Vredeveld, Tjark
core  

Some of the next articles are maybe not open access.

Related searches:

Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints

SIAM Journal on Optimization, 2007
We consider the NP-hard problem of finding a minimum norm vector in $n$-dimensional real or complex Euclidean space, subject to $m$ concave homogeneous quadratic constraints. We show that a semidefinite programming (SDP) relaxation for this nonconvex quadratically constrained quadratic program (QP) provides an $O(m^2)$ approximation in the real case ...
Zhi-Quan Luo, Nicholas D Sidiropoulos, Paul Tseng   +2 more
exaly   +2 more sources

Approximation Algorithms for Quadratic Programming

Journal of Combinatorial Optimization, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minyue Fu 0001, Zhi-Quan Luo, Yinyu Ye 0001   +2 more
openaire   +3 more sources

Asymmetric quadratic landscape approximation model

Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, 2014
This work presents an asymmetric quadratic approximation model and an $\epsilon$-archiving algorithm. The model allows to construct, under local convexity assumptions, descriptors for local optima points in continuous functions. A descriptor can be used to extract confidence radius information. The $\epsilon$-archiving algorithm is designed to maintain
Alexandru-Adrian Tantar, Emilia Tantar, Oliver Schütze 0001   +2 more
openaire   +3 more sources

A quadratic approximation for structural topology optimization

International Journal for Numerical Methods in Engineering, 2010
In topology optimization, it is customary to use reciprocal-like approximations, which result in monotonically decreasing approximate objective functions. In this paper, we demonstrate that efficient quadratic approximations for topology optimization can
Albert A Groenwold, L F P Etman
exaly   +2 more sources

Quadratic approximation in ℚ_p

International Journal of Number Theory, 2014
Let p be a prime number. Let w2and [Formula: see text] denote the exponents of approximation defined by Mahler and Koksma, respectively, in their classifications of p-adic numbers. It is well-known that every p-adic number ξ satisfies [Formula: see text], with [Formula: see text] for almost all ξ.
Bugeaud, Yann, Pejković, Tomislav
openaire   +5 more sources