نتایج جستجو برای: product reformulation
تعداد نتایج: 284832 فیلتر نتایج به سال:
Quadratic 0-1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
Many combinatorial optimization problems can be formulated as the minimization of a 0-1 quadratic function subject to linear constraints. In this paper, we are interested in the exact solution of this problem through a two-phase general scheme. The first phase consists in reformulating the initial problem either into a compact mixed integer linear program or into a 0-1 quadratic convex program....
The key assumption of activated complex theory (ACT), that the AC is in thermodynamic equilibrium with the reactants, needs to be reconsidered. This is because the formation of the AC is slower than its collapse to product. However, this can be remedied by assuming that the AC is formed in a rapid pre-equilibrium as a thermally activated species, which collapses to products in a slow step invol...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید