in the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. in this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. two path inequalities for the node-only interdiction problem are represented. it has been proved that the integrality gap of relaxation of the maximum fl...

Modern processors come close to executing as fast as true dependencies allow. The particular dependencies that constrain execution speed constitute the critical path of execution. To optimize the performance of the processor, we either have to reduce the critical path or execute it more efficiently. In both cases, it can be done more effectively if we know the actual path. This paper describes ...

Six Sigma is a strategy for achieving process improvement and operational excellence within an organization. Decisions on critical parameter selection in analysis phase are always very crucial; it plays a primary role in successful execution of Six Sigma project and for productivity improvement in manufacturing environment and involves the imprecise, vague and uncertain information. Using a cas...

Considering the major change occurred in business cells from plant to “chain” and the critical need to choose the best partners to form the supply chain for competing in today’s business setting, one of the vital decisions made at the early steps of constructing a business is supplier selection. Given the fact that the early decisions are inherently strategic and therefore hard and costly to c...

Genetic algorithms have been successfully applied in the area of software testing. The demand for automation of test case generation in object oriented software testing is increasing. Genetic algorithms are well applied in procedural software testing but a little has been done in testing of object oriented software. This paper discusses genetic algorithms that can automatically select an effici...

In this paper, we investigate the problem of finding the Delay Constrained Least Cost path (DCLC) in a network, which is NP-complete and has been extensively studied. Many proposed algorithms tackle this problem by transforming it into the shortest path selection problem or the k-shortest paths selection problem, which are P-complete, with an integrated weight function that maps the delay and c...

Real-time communication where the timely delivery of the data transfer requests needs to be guaranteed is essential for several applications. This work formally introduces the Real-Time Unsplittable Data Dissemination Problem (RTU/DDP), which is a generalization of the unsplittable flow problem. RTU/DDP problem is proved to be NP-hard. Therefore, heuristic approaches are required to acquire goo...

Over the past several years, there has been a considerable amount of research within the field of Quality of Service (QoS) support for distributed multimedia systems. One of the key issues in providing end-to-end QoS guarantees in packet networks is determining a feasible path that satisfies a number of QoS constraints. The problem of finding a feasible path is NPComplete if number of constrain...