نتایج جستجو برای: linear assignment
تعداد نتایج: 523124 فیلتر نتایج به سال:
This paper introduces an original planning model which integrates production, human resources and cash management decisions, taking into account the consequences that decisions in one area may have on other areas and allowing all these areas to be coordinated. The most relevant characteristics of the planning problem are: (1) production capacity is a non-linear function of the size of the staff...
Throughput limitation of wireless networks imposes many practical problems as a result of wireless media broadcast nature. The solutions of the problem are mainly categorized in two groups; the use of multiple orthogonal channels and network coding (NC). The networks with multiple orthogonal channels and possibly multiple interfaces can mitigate co-channel interference among nodes. However, eff...
Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations of an undirected graph. For example, acyclic orientations with certain diameter constraints are closely related to the optimal solutions of the vertex coloring and frequency assignment problems. In this paper we introduce a linear programming formulation of acyclic orientations with path const...
Linear programming is a fundamental planning tool. It is often difficult to precisely estimate or forecast certain critical data elements of the linear program. In such cases, it is necessary to address the impact of uncertainty during the planning process. We discuss a variety of LP-based models that can be used for planning under uncertainty. In all cases, we begin with a de-terministic LP mo...
The Quadratic Assignment Problem (QAP) is the problem of making exclusive assignments of n indivisible entities to n other indivisible entities in such a way that a total quadratic interaction cost is minimized. The problem can be interpreted from a wide variety of perspectives. The perspective adopted in this paper is that of the generic facilities location/layout context, as in the seminal wo...
We present an integer linear formulation that uses the so-called “distance variables” to solve the quadratic assignment problem (QAP). The model involves O(n) variables. Valid equalities and inequalities are additionally proposed. We further improved the model by using metric properties as well as an algebraic characterization of the Manhattan distance matrices that Mittelman and Peng [28] rece...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید