Using Infeasible Nodes to Select Branching Variables
    8.
    发明申请
    Using Infeasible Nodes to Select Branching Variables 有权
    使用不可行节点选择分支变量

    公开(公告)号:US20120173586A1

    公开(公告)日:2012-07-05

    申请号:US13421675

    申请日:2012-03-15

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30961

    摘要: An optimization engine identifies an infeasible node in a tree data structure that corresponds to a programming model, and computes a fake objective value for the infeasible node. The optimization engine then updates a branching variable pseudocost using the fake objective value. Next, the optimization engine uses multiple branching variable pseudocosts corresponding to multiple branching variable candidates in order to select one of the branching variable candidates. In turn, the optimization engine branches to the corresponding branch of the selected branching variable.

    摘要翻译: 优化引擎识别与编程模型相对应的树数据结构中的不可行节点,并计算不可行节点的假目标值。 优化引擎然后使用假目标值更新一个分支变量pseudocost。 接下来,优化引擎使用与多个分支变量候选对应的多个分支变量pseudocost,以便选择一个分支变量候选。 反过来,优化引擎分支到所选择的分支变量的相应分支。

    Using infeasible nodes to select branching variables

    公开(公告)号:US08739114B2

    公开(公告)日:2014-05-27

    申请号:US12580329

    申请日:2009-10-16

    IPC分类号: G06F9/44 G06Q10/00

    CPC分类号: G06F17/30961

    摘要: An optimization engine identifies an infeasible node in a tree data structure that corresponds to a programming model, and computes a fake objective value for the infeasible node. The optimization engine then updates a branching variable pseudocost using the fake objective value. Next, the optimization engine uses multiple branching variable pseudocosts corresponding to multiple branching variable candidates in order to select one of the branching variable candidates. In turn, the optimization engine branches to the corresponding branch of the selected branching variable.

    USING INFEASIBLE NODES TO SELECT BRANCHING VARIABLES
    10.
    发明申请
    USING INFEASIBLE NODES TO SELECT BRANCHING VARIABLES 有权
    使用不确定的节点选择分支变量

    公开(公告)号:US20110093834A1

    公开(公告)日:2011-04-21

    申请号:US12580329

    申请日:2009-10-16

    IPC分类号: G06F9/44

    CPC分类号: G06F17/30961

    摘要: An optimization engine identifies an infeasible node in a tree data structure that corresponds to a programming model, and computes a fake objective value for the infeasible node. The optimization engine then updates a branching variable pseudocost using the fake objective value. Next, the optimization engine uses multiple branching variable pseudocosts corresponding to multiple branching variable candidates in order to select one of the branching variable candidates. In turn, the optimization engine branches to the corresponding branch of the selected branching variable.

    摘要翻译: 优化引擎识别与编程模型相对应的树数据结构中的不可行节点,并计算不可行节点的假目标值。 优化引擎然后使用假目标值更新一个分支变量pseudocost。 接下来,优化引擎使用与多个分支变量候选对应的多个分支变量pseudocost,以便选择一个分支变量候选。 反过来,优化引擎分支到所选择的分支变量的相应分支。