全文获取类型
收费全文 | 54篇 |
免费 | 9篇 |
专业分类
63篇 |
出版年
2021年 | 3篇 |
2018年 | 2篇 |
2016年 | 1篇 |
2015年 | 3篇 |
2014年 | 3篇 |
2013年 | 2篇 |
2011年 | 1篇 |
2009年 | 4篇 |
2008年 | 2篇 |
2006年 | 1篇 |
2005年 | 1篇 |
2004年 | 4篇 |
2003年 | 3篇 |
2002年 | 1篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 1篇 |
1998年 | 2篇 |
1997年 | 4篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1978年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
1969年 | 1篇 |
排序方式: 共有63条查询结果,搜索用时 0 毫秒
41.
This article investigates the optimal inventory and admission policies for a “Clicks‐and‐Bricks” retailer of seasonal products that, in addition to selling through its own physical and online stores, also sells through third‐party websites by means of affiliate programs. Through postings on partners' webpages, an affiliate program allows a retailer to attract customers who would otherwise be missed. However, this retailer needs to pay a commission for each sale that originates from the website operators participating in the program. The retailer may also refer online orders to other sources (such as distributors and manufacturers) for fulfillment through a drop‐shipping agreement and thus earns commissions. This would be an option when, for example, the inventories at the physical stores were running low. Therefore, during the selling horizon, the retailer needs to dynamically control the opening/closing of affiliate programs and decide on the fulfillment option for online orders. On the basis of a discrete‐time dynamic programming model, the optimal admission policy of the retailer is investigated in this paper, and the structural properties of the revenue function are characterized. Numerical examples are given to show the revenue impact of optimal admission control. The optimal initial stocking decisions at the physical stores are also studied. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
42.
The shortest path problem between two specified nodes in a general network possesses the unimodularity property and, therefore, can be solved by efficient labelling algorithms. However, the introduction of an additional linear constraint would, in general, destroy this property and the existing algorithms are not applicable in this case. This paper presents a parametric approach for solving this problem. The algorithm presented would require, on the average, a number of iterations which is polynomially bounded. The similarity of this approach to that of the generalized Lagrange multiplier technique is demonstrated and a numerical example is presented. 相似文献
43.
A method previously devised for the solution of the p-center problem on a network has now been extended to solve the analogous minimax location-allocation problem in continuous space. The essence of the method is that we choose a subset of the n points to be served and consider the circles based on one, two, or three points. Using a set-covering algorithm we find a set of p such circles which cover the points in the relaxed problem (the one with m < n points). If this is possible, we check whether the n original points are covered by the solution; if so, we have a feasible solution to the problem. We now delete the largest circle with radius rp (which is currently an upper limit to the optimal solution) and try to find a better feasible solution. If we have a feasible solution to the relaxed problem which is not feasible to the original, we augment the relaxed problem by adding a point, preferably the one which is farthest from its nearest center. If we have a feasible solution to the original problem and we delete the largest circle and find that the relaxed problem cannot be covered by p circles, we conclude that the latest feasible solution to the original problem is optimal. An example of the solution of a problem with ten demand points and two and three service points is given in some detail. Computational data for problems of 30 demand points and 1–30 service points, and 100, 200, and 300 demand points and 1–3 service points are reported. 相似文献
44.
The standard problem in sampling inspection is to consider plans with and without curtailment. Curtailment causes difficulty and authors rarely give exact results (i.e., exact OC and ASN functions) for curtailed procedures. In this article we regard curtailment as an inverse sampling procedure and use Dirichlet integrals to obtain exact formulas for the OC, the ASN, and also the variance of the number of observations required under three types of plans: no curtailment, semicurtailment (for rejection only) and two-sided curtailment. Different sections of the article deal with the single sample, the two-stage, and the multiple-stage sampling problems. New tables for carrying out the single-sample procedure are included in the article. The authors feel that this article presents new directions and new ways of dealing with problems associated with quality control. 相似文献
45.
Particulate composites are one of the widely used materials in producing numerous state-of-the-art components in biomedical, automobile, aerospace including defence technology. Variety of modelling techniques have been adopted in the past to model mechanical behaviour of particulate composites. Due to their favourable properties, particle-based methods provide a convenient platform to model failure or fracture of these composites. Smooth particle hydrodynamics (SPH) is one of such methods which demonstrate excellent potential for modelling failure or fracture of particulate composites in a Lagrangian setting. One of the major challenges in using SPH method for modelling composite materials depends on accurate and efficient way to treat interface and boundary conditions. In this paper, a master-slave method based multi-freedom constraints is proposed to impose essential boundary conditions and interfacial displacement constraints in modelling mechanical behaviour of composite materials using SPH method. The proposed methodology enforces the above constraints more accurately and requires only smaller condition number for system stiffness matrix than the procedures based on typical penalty function approach. A minimum cut-off value-based error criteria is employed to improve the compu-tational efficiency of the proposed methodology. In addition, the proposed method is further enhanced by adopting a modified numerical interpolation scheme along the boundary to increase the accuracy and computational efficiency. The numerical examples demonstrate that the proposed master-slave approach yields better accuracy in enforcing displacement constraints and requires approximately the same computational time as that of penalty method. 相似文献
46.
Liquid-filled compartment structure consists of a bulk steel plate with matrix blind holes which are filled with liquid and a steel front plate to seal up the liquid with rings and bolts.The liquid-filled compart-ment structure can resist the shaped charge warhead effectively.This paper presents experimental and theoretical investigations of the penetration ability of the residual shaped charge jet emerging from the liquid-filled compartment structure after the penetration process at different impact angles.On the basis of shock wave propagation theory,the influence of the liquid-filled compartment structure on jet sta-bility is analysed.The interferences of the liquid backflow caused by a reflected shock wave and a back plate on jet stability under different impact angles are also examined.In addition,the range of the disturbed velocity segments of the jet at different impact angles and the penetration ability of the re-sidual jet are obtained.A theoretical model is validated against the experimental penetration depths. 相似文献
47.
Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost 下载免费PDF全文
Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016 相似文献
48.
A.Y. Garnaev 《海军后勤学研究》1997,44(4):353-364
The following zero-sum game is considered. Red chooses in integer interval [1, n] two integer intervals consisting of k and m points where k + m < n, and Blue chooses an integer point in [1, n]. The payoff to Red equals 1 if the point chosen by Blue is at least in one of the intervals chosen by Red, and 0 otherwise. This work complements the results obtained by Ruckle, Baston and Bostock, and Lee. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 353–364, 1997 相似文献
49.
Hazard rate processes are discussed in the context of doubly stochastic Poisson processes. We derive an explicit expression for the reliability function corresponding to an increasing hazard rate processes with independent increments. Also, bounds are obtained for the reliability function of a system with a general hazard rate process. 相似文献
50.
The discrete evasion game with three-move lag, formulated over 30 years ago, was one of the earliest games with time-lag complications. This game remains unsolved even though it is well known that the game has a value. In this article we obtain an upper bound for the value by constructing a strategy which consists of 400 conditional probabilities for the minimizing player. This is believed to be the best upper bound known. 相似文献