نتایج جستجو برای: two mixed integer programming
تعداد نتایج: 2865734 فیلتر نتایج به سال:
in this paper, a mathematical method is proposed to formulate a generalized ordering problem. this model is formed as a linear optimization model in which some variables are binary. the constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. on the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...
Radio network planning for UMTS technology is a relevant task for operators in the current roll-out phase. We recall a mathematical mixed-integer programming model for planning cost-efficient radio networks under network quality constraints. Based on this model, we present network planning methods. Computational results are given for two large-scale, realistic scenarios, and we compare the mixe...
Abstract We study the existence and construction of very small formulations for disjunctive constraints in optimization problems: that is, formulations that use very few integer variables and extra constraints. To accomplish this, we present a novel mixed-integer branching formulation framework, which preserves many of the favorable algorithmic properties of a traditional mixed-integer programm...
Abstract The most important ingredient for solving mixed-integer nonlinear programs (MINLPs) to global $$\epsilon $$ ϵ -optimality with spatial branch and bound is a tight, computationally tractable relaxation. Due both theoretical practical considerations, relaxations of MINLPs are usually required be convex...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید