Search Results - subject:"Approximation algorithms"

Did you mean: subject:"Approximation algorithm" (11,330 results)

Approximation balancing policies for inventory systems with remanufacturing

Tao, Zhijie; Zhou, Sean X. - In: Mathematics of operations research 39 (2014) 4, pp. 1179-1197

Persistent link: https://www.econbiz.de/10010462150

Hardness and approximation results for Lp-ball constrained homogeneous polynomial optimization problems

Hou, Ke; So, Anthony Man-Cho - In: Mathematics of operations research 39 (2014) 4, pp. 1084-1108

Persistent link: https://www.econbiz.de/10010462162

Approximation algorithm for the stochastic multiperiod inventory problem via a look-ahead optimization approach

Truong, Van-Anh - In: Mathematics of operations research 39 (2014) 4, pp. 1039-1056

Persistent link: https://www.econbiz.de/10010462174

Role refinement in access control : model and analysis

Xia, Hao; Dawande, Milind; Mookerjee, Vijay S. - In: INFORMS journal on computing : JOC 26 (2014) 4, pp. 866-884

Persistent link: https://www.econbiz.de/10010477689

Approximations to auctions of digital goods with share-averse bidders

Pei, Jinxiang; Klabjan, Diego; Xie, Wei - In: Electronic commerce research and applications 13 (2014) 2, pp. 128-138

Persistent link: https://www.econbiz.de/10011348328

Fixed-dimensional stochastic dynamic programs : an approximation scheme and an inventory application

Chen, Wei; Dawande, Milind; Janakiraman, Ganesh - In: Operations research 62 (2014) 1, pp. 81-103

Persistent link: https://www.econbiz.de/10010338558

The Complexity of Optimizing over a Simplex, Hypercube or Sphere : A Short Survey

de Klerk, Etienne - Tilburg University, Center for Economic Research - 2006

We consider the computational complexity of optimizing various classes of continuous functions over a simplex, hypercube or sphere.These relatively simple optimization problems have many applications.We review known approximation results as well as negative (inapproximability) results from the...

Persistent link: https://www.econbiz.de/10011092404

Geometric branch-and-bound methods for constrained global optimization problems

Scholz, Daniel - In: Journal of Global Optimization 57 (2013) 3, pp. 771-782

Geometric branch-and-bound methods are popular solution algorithms in deterministic global optimization to solve problems in small dimensions. The aim of this paper is to formulate a geometric branch-and-bound method for constrained global optimization problems which allows the use of arbitrary...

Persistent link: https://www.econbiz.de/10010896353

The generalized assignment problem with minimum quantities

Krumke, Sven O.; Thielen, Clemens - In: European Journal of Operational Research 228 (2013) 1, pp. 46-55

complexity results for different versions of the problem and give polynomial time exact algorithms and approximation algorithms … approximation algorithm (unless P=NP), even for the case of a single bin. This motivates to study dual approximation algorithms that …

Persistent link: https://www.econbiz.de/10011052812

Approximations for two variants of the Steiner tree problem in the Euclidean plane <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${\mathbb{R}^2}$$</EquationSource> </InlineEquation>

Li, Jianping; Wang, Haiyan; Huang, Binchao; Lichen, Junran - In: Journal of Global Optimization 57 (2013) 3, pp. 783-801

problem, and then present two approximation algorithms with performance ratios 4 and 3.236 for the MCSPPSM problem …

Persistent link: https://www.econbiz.de/10010994113