共查询到20条相似文献,搜索用时 0 毫秒
1.
V. V. Shenmaier 《Journal of Applied and Industrial Mathematics》2012,6(3):381-386
We consider the following clustering problem: Given a vector set, find a subset of cardinality k and minimum square deviation from its mean. The distance between the vectors is defined by the Euclideanmetric. We present an approximation scheme (PTAS) that allows us to solve this problem with an arbitrary relative error ? in time O(n 2/?+1(9/?)3/? d), where n is the number of vectors of the input set and d denotes the dimension of the space. 相似文献
2.
Under study is a strongly NP-hard problem of finding a subset of a given size of a finite set of vectors in Euclidean space which minimizes the sum of squared distances from the elements of this subset to its center. The center of the subset is defined as the average vector calculated with all subset elements. It is proved that, unless P=NP, in the general case of the problem there is no fully polynomial time approximation scheme (FPTAS). Such a scheme is provided in the case when the dimension of the space is fixed. 相似文献
3.
The authors provide some 2-approximation algorithm for an intractable problem to which one can reduce the problem of partitioning a vector set in Euclidean space into the two subsets (clusters) having the minimum sum of distance squares. 相似文献
4.
设施布局问题的研究始于20世纪60年代,主要研究选择修建设施的位置和数量,以及与需要得到服务的城市之间的分配关系,使得设施的修建费用和设施与城市之间的连接费用之和达到最小.现实生活中, 受自然灾害、工人罢工、恐怖袭击等因素的影响,修建的设施可能会出现故障, 故连接到它的城市无法得到供应,这就直接影响到了整个系统的可靠性.针对如何以相对较小的代价换取设施布局可靠性的提升,研究人员提出了可靠性设施布局问题.参考经典设施布局问题的贪婪算法、原始对偶算法和容错性问题中分阶段分层次处理的思想,设计了可靠性设施布局问题的一个组合算法.该算法不仅在理论上具有很好的常数近似度,而且还具有运算复杂性低的优点.这对于之前的可靠性设施布局问题只有数值实验算法, 是一个很大的进步. 相似文献
5.
In location-routing problems, the objective is to locate one or many depots within a set of sites (representing customer locations or cities) and to construct delivery routes from the selected depot or depots to the remaining sites at least system cost. The objective function is the sum of depot operating costs, vehicle acquisition costs and routing costs. This paper considers one such problem in which a weight is assigned to each site and where sites are to be visited by vehicles having a given capacity. The solution must be such that the sum of the weights of sites visited on any given route does not exceed the capacity of the visiting vehicle. The formulation of an integer linear program for this problem involves degree constraints, generalized subtour elimination constraints, and chain barring constraints. An exact algorithm, using initial relaxation of most of the problem constraints, is presented which is capable of solving problems with up to twenty sites within a reasonable number of iterations. 相似文献
6.
7.
The economic lot scheduling problem has driven considerable amount of research. The problem is NP-hard and recent research
is focused on finding heuristic solutions rather than searching for optimal solutions. This paper introduces a heuristic method
using a tabu search algorithm to solve the economic lot scheduling problem. Diversification and intensification schemes are
employed to improve the efficiency of the proposed Tabu search algorithm. Experimental design is conducted to determine the
best operating parameters for the Tabu search. Results show that the tabu search algorithm proposed in this paper outperforms
two well known benchmark algorithms. 相似文献
8.
9.
10.
We study the complete set packing problem (CSPP) where the family of feasible subsets may include all possible combinations of objects. This setting arises in applications such as combinatorial auctions (for selecting optimal bids) and cooperative game theory (for finding optimal coalition structures). Although the set packing problem has been well-studied in the literature, where exact and approximation algorithms can solve very large instances with up to hundreds of objects and thousands of feasible subsets, these methods are not extendable to the CSPP since the number of feasible subsets is exponentially large. Formulating the CSPP as an MILP and solving it directly, using CPLEX for example, is impossible for problems with more than 20 objects. We propose a new mathematical formulation for the CSPP that directly leads to an efficient algorithm for finding feasible set packings (upper bounds). We also propose a new formulation for finding tighter lower bounds compared to LP relaxation and develop an efficient method for solving the corresponding large-scale MILP. We test the algorithm with the winner determination problem in spectrum auctions, the coalition structure generation problem in coalitional skill games, and a number of other simulated problems that appear in the literature. 相似文献
11.
M. Lukka 《Journal of Optimization Theory and Applications》1979,28(3):435-438
An algorithm for finding agood solution for a multiple criteria optimal control problem is given. The criteria are assumed to be ordered according to their importance to the decision-maker. The algorithm consists of successive solutions of single criterion optimal control problems. Other criteria are taken into account by adding constraints to the problem in a systematic manner. 相似文献
12.
V. V. Shenmaier 《Journal of Applied and Industrial Mathematics》2017,11(4):584-593
We consider the problem: Given a set of n vectors in the d-dimensional Euclidean space, find a subsetmaximizing the length of the sum vector.We propose an algorithm that finds an optimal solution to this problem in time O(nd?1(d + logn)). In particular, if the input vectors lie in a plane then the problem is solvable in almost linear time. 相似文献
13.
14.
The generalized assignment problem can be viewed as the following problem of scheduling parallel machines with costs. Each job is to be processed by exactly one machine; processing jobj on machinei requires timep
ij
and incurs a cost ofc
ij
; each machinei is available forT
i
time units, and the objective is to minimize the total cost incurred. Our main result is as follows. There is a polynomial-time algorithm that, given a valueC, either proves that no feasible schedule of costC exists, or else finds a schedule of cost at mostC where each machinei is used for at most 2T
i
time units.We also extend this result to a variant of the problem where, instead of a fixed processing timep
ij
, there is a range of possible processing times for each machine—job pair, and the cost linearly increases as the processing time decreases. We show that these results imply a polynomial-time 2-approximation algorithm to minimize a weighted sum of the cost and the makespan, i.e., the maximum job completion time. We also consider the objective of minimizing the mean job completion time. We show that there is a polynomial-time algorithm that, given valuesM andT, either proves that no schedule of mean job completion timeM and makespanT exists, or else finds a schedule of mean job completion time at mostM and makespan at most 2T.
Research partially supported by an NSF PYI award CCR-89-96272 with matching support from UPS, and Sun Microsystems, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550.Research supported in part by a Packard Fellowship, a Sloan Fellowship, an NSF PYI award, and by the National Science Foundation, the Air Force Office of Scientific Research, and the Office of Naval Research, through NSF grant DMS-8920550. 相似文献
15.
This paper describes the traveling tournament problem, a well-known benchmark problem in the field of tournament timetabling.
We propose a new lower bound for the traveling tournament problem, and construct a randomized approximation algorithm yielding
a feasible solution whose approximation ratio is less than 2+(9/4)/(n−1), where n is the number of teams. Additionally, we propose a deterministic approximation algorithm with the same approximation ratio
using a derandomization technique. For the traveling tournament problem, the proposed algorithms are the first approximation
algorithms with a constant approximation ratio, which is less than 2+3/4. 相似文献
16.
Vincenzo Bonifaci Peter Korteweg Alberto Marchetti-Spaccamela Leen Stougie 《Operations Research Letters》2008,36(5):605-608
The Wireless Gathering Problem is to find an interference-free schedule for data gathering in a wireless network in minimum time. We present a 4-approximate polynomial-time on-line algorithm for this NP-hard problem. We show that no shortest path following algorithm can have an approximation ratio better than 4. 相似文献
17.
V. V. Shenmaier 《Journal of Applied and Industrial Mathematics》2009,3(1):128-132
The hierarchical median problem asks for a hierarchical sequence of solutions to the k-median problems of growing cardinality. The best algorithm known for this problem in the general metric case has competitive ratio 20.71. In the paper, the case is under study that the clients and facilities lie on the real line, as well as the case of a Euclidean space. An algorithm is proposed with competitive ratio 8 in the case of the real line, and 8 + 4√2 (approximately 13.66), in the Euclidean case. 相似文献
18.
Summary.
The aim of this work is to study a decoupled algorithm of
a fixed point for solving a
finite element (FE) problem for the approximation of viscoelastic
fluid flow obeying an Oldroyd B differential model. The interest for
this algorithm lies in its applications to numerical simulation and
in the cost of computing. Furthermore it is easy to bring this
algorithm into play.
The unknowns
are
the viscoelastic part of the extra stress tensor,
the velocity and
the pressure.
We suppose that the solution
is sufficiently
smooth and small. The approximation
of stress, velocity and pressure are resp.
discontinuous,
continuous,
continuous FE. Upwinding needed for convection of
, is made
by discontinuous FE. The method consists to
solve alternatively a transport equation for the stress,
and a Stokes like problem for velocity and pressure. Previously,
results of existence of the solution for the approximate problem and
error bounds have been obtained using fixed point
techniques with coupled algorithm.
In this paper we show that the mapping of the decoupled
fixed point algorithm is locally (in a neighbourhood of
)
contracting and we obtain existence, unicity (locally) of the solution
of the approximate problem and error bounds.
Received
July 29, 1994 / Revised version received March 13, 1995 相似文献
19.
This paper is concerned with a problem of maximizing the sum of several ratios of functions. We extend an algorithm, which has been designed to solve the sum-of-linear-ratios problem, for solving the sum-of-nonlinear-ratios problem. We also discuss the complexity of the problem and report the results of numerical experiments on the extended algorithm. 相似文献
20.
I. M. Guseinov Ag. Kh. Khanmamedov 《Computational Mathematics and Mathematical Physics》2009,49(9):1516-1520
For the Cauchy problem for a Langmuir lattice with fixed ends, an algorithm based on the inverse scattering method is designed
and substantiated. 相似文献