The Postage Stamp Problem: An algorithm to determine the h-range on the h-range formula on the extremal basis problem for k = 4
نویسنده
چکیده
Given an integral “stamp” basis Ak with 1 = a1 < a2 < . . . < ak and a positive integer h, we define the h-range n(h, Ak) as n(h, Ak) = max{N ∈ N | n ≤ N =⇒ n = k ∑
منابع مشابه
Algorithms for Computing the A - Range of the Postage Stamp Problem
New algorithms, based on a very efficient method to compute the A-range, have been used to extend known tables of the extremal /¡-range, to complete the solution in the case k = 3, and to find a lower bound for the extremal 2-range.
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملRobust Coordinated Design of UPFC Damping Controller and PSS Using Chaotic Optimization Algorithm
A Chaotic Optimization Algorithm (COA) based approach for the robust coordinated design of the UPFC power oscillation damping controller and the conventional power system stabilizer has been investigated in this paper. Chaotic Optimization Algorithms, which have the features of easy implementation, short execution time and robust mechanisms of escaping from local optimum, is a promising tool fo...
متن کاملA Rapid Optimization Method for Slip Surface in Earth Slopes Using Genetic Algorithm
This paper introduces an accurate, fast, and applicable method for optimization of slip surfaces in earth slopes. Using Genetic Algorithm (GA), which is one of the modern and non-classic optimization methods, in conjunction with the well -known Bishop applied method, the optimum slip surface in an earth slope is investigated and its corresponding lowest safety factor is determined. Investigati...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 69 شماره
صفحات -
تاریخ انتشار 2000