In this paper, we propose a practical cut generation method based on the Chvatal-Gomory procedure for the (0, 1)-Knapsack problem with a variable capacity. For a given set N of n items each of which has a positive integral weight and a facility of positive integral capacity, a feasible solution of the problem is defined as a subset S of N along with the number of facilities that can satisfy the sum of weights of all the items in S. We first derive a class of valid inequalities for the problem using Chvatal-Gomory procedure, then analyze the associated separation problem. Based on the results, we develop an affective cut generation method. We then analyze the theoretical strength of the inequalities which can be generated by the proposed cut generation method. Preliminary computational results are also presented which show the effectiveness of the proposed cut generation method.

We consider the Steiner tree packing problem. For a given undirected graph G =(V, E) with positive integer capacities and non-negative weights on its edges, and a list of node sets(nets), the problem is to find a connection of nets which satisfies the edge capacity limits and minimizes the total weights. We focus on the switchbox routing problem in knock-knee model and formulate this problem as an integer programming using Steiner tree variables. The model contains exponential number of variables, but the problem can be solved using a polynomial time column generation procedure. We test the algorithm on some standard test instances and compare the performances with the results using cutting plane approach. Computational results show that our algorithm is competitive to the cutting plane algorithm presented by Grotschel et al. and can be used to solve practically sized problems.

Expected number of visits in the steady state of the regenerative process is one of the most useful characteristics. The formula for this expected number of visits in the steady state of the regenerative process is presented in this paper. Because this formula is for the general model, it can be applied to many special systems including 2-unit redundant system. An example for this formula is also presented.

We consider the question of warranties for repairable items. During the warranty period, each time an item fails the manufacturer has the obligation to restore the item to operational condition either by repairing the item or by replacing it by a new item. In this paper, we consider a warranty policy for making this decision based on the condition of the failed item. For products with phase-type lifetime distributions where the phases represent the condition of the item, we develop algorithms to determine the expected cost of servicing a warranty and use it in making the repair/replacement decision. illustrative numerical examples are presented.

A vendor supplies a product to a sole/major buyer on a lot-for-lot basis under deterministic inventory control conditions. The basic premise is that the setup cost reduction technologies are available to both the buyer and the vendor, and that the vendor's inventory and setup reduction investment costs differ from the buyer's. Therefore, an individually designed ordering and setup cost reduction policy will likely cause mismatches between the vendor's and the buyer's optimal cycle times. For this situation, we show that a joint optimal setup cost reduction and ordering policy, together with an appropriate side payment(quantity discount or premium price) schedule, can be designed in a spirit in a spirit of coordination to eliminate mismatches in individual optimal cycle times.

Based on the results of the internet service survey, the traffic demand forecasts of the AO/DI internet service and N-ISDN service have been performed for each channel(B-channel and D-channel). These traffic forecasts can be used as useful input data for investigating packet processing capacity of the TDX-10A switching system and suggesting guideline for capacity increasement.

The real-time multicast problem is to construct a multicast tree starting from a source node and including multiple destination nodes and that has minimum network cost with delay constraints. It is known that to find a tree of the minimum network cost is the Steiner Tree problem which is NP-complete. In this paper, we propose a genetic algorithm to solve the multicast tree with minimum network cost and the delay constraints. The computational results obtained by comparing an existing algorithm. Kompella algorithm, and the proposed algorithm show that our algorithm tends to find lower network cost on the average than Kompella algorithm does.

The linear programming model is a special form of useful knowledge that is embedded in a database. Since formulating models from scratch requires knowledge-intensive efforts, knowledge-based formulation support systems have been proposed in the Decision Support Systems area. However, they rely on the assumption that sufficient domain knowledge should already be captured as a specific knowledge representation form. Hence, the purpose of this paper is to propose a methodology that finds useful knowledge on building linear programming models from a database. The methodology consists of two parts. The first part is to find s first-cut model based on a data dictionary. To do so, we applied the General Problem Solver(GPS) algorithm. The second part is to discover a second-cut model by applying neural network technique. An illustrative example is described to show the feasibility of the proposed methodology.

For rational human value judgement and evaluation, provision of clear evaluation data, objective value judgement criteria, and properly generalized methods are required. For instance, this is true for software quality evaluation, and the measure of software quality and the weighting method of evaluation target directly affect final decisions. However it is not easy to find a generalized method for the software quality evaluation or product selection, because of its complex characteristics. In this paper, we apply the qualitative preference method based on quantitative belief functions to find a general weighing method for the software quality evaluation. In particular, the qualitative preference method, in which the differentiated preference expression is possible, is conceptually expanded for general applications in future. For this purpose, we hierarchically differentiate the strong preference relation from the weak preference relation, and show an example of quantification of software quality evaluation on different applications, by comparing the qualitative preference method with AHP. We believe that the application domain of this method is not limited to the software quality evaluation and it is very useful to apply this results to other SE areas, e.g., metric selection with different views and riority determination of practices to be assessed in the SPICE.

Many different statistical and artificial intelligent techniques have been applied to improve the predictability of credit rating. Hybrid models and systems have also been developed by effectively combining different modeling processes or combining the outcomes of individual models. In this paper, we introduced the rough set theory and developed a hybrid credit rating system that combines individual outcomes in terms of rough set theory. An experiment was conducted to compare the prediction capability of the system with those of other methods. The proposed system based on rough set method outperformed the others.

This paper suggests a balanced scorecard (BSC) framework for measuring and evaluating the performance of knowledge workers in professional service firms(PSFs) which are typical knowldege-based organizations. As a strategic learning system, the balanced scorecard allows business leaders to drive and modify their business strategies based on the balanced measurement of key performance indicators(KPIs), which are basically divided into four domains such as financial achievement, customer orientation, internal business process, and innovation and learning. Conducting a focused case study on performance evaluation of knowledge workers from a balanced viewpoint, we could evaluate their competency and potential in more comprehensive manner. We also employ the analytic hierarchy process (AHP) approach for derive relative weights of key performance indicators and link it to a spreadsheet model for rating the individual performance of knowledge workers in a systematic way.