Results 241 to 250 of about 76,024 (266)
Some of the next articles are maybe not open access.

The Approximability of Learning and Constraint Satisfaction Problems

2010
An α-approximation algorithm is an algorithm guaranteed to output a solutionthat is within an α ratio of the optimal solution. We are interested in thefollowing question: Given an NP-hard optimization problem, what is the bestapproximation guarantee that any polynomial time algorithm could achieve? We mostly focus on studying the approximability of two
openaire   +1 more source

Approximation with Convex Constraints

Journal of the Society for Industrial and Applied Mathematics, 1963
openaire   +1 more source

An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints

European Journal of Operational Research, 2005
Cherif Sadfi   +2 more
exaly  

Sample average approximation for a two-echelon inventory system with service-level constraints

Journal of the Operational Research Society, 2019
Shing Chih Tsai
exaly  

Home - About - Disclaimer - Privacy