用匹配法检测某些可移植程序的不可行性
Using Matching to Detect Infeasibility of Some Integer Programs
摘要:
提出了一种新的基于匹配的启发式算法来检测特殊形式的不可行零一IP。该算法的输入是一组嵌套的双随机子系统和一组E的实例定义变量设置在零水平。该算法推导额外的变量在零水平,直到违反约束(IP是不可行的),或没有更多的变量可以推导为零(IP是未定的)。所有可行IP和所有未检测到不可行的不可行IP都是未决定的。我们成功地将该算法应用到一个小的一套专门制定的不可行的零-一IP实例的汉密尔顿循环决策问题。我们展示了如何建模的图形和子图同构决策问题的输入算法。嵌套双随机子系统的增加的水平可以动态地实现。该算法是为并行处理而设计的,并且除了匹配之外还包括技术。
英文摘要:
A novel matching based heuristic algorithm designed to detect specially formulated infeasible zero-one IPs is presented. The algorithm input is a set of nested doubly stochastic subsystems and a set E of instance defining variables set at zero level. The algorithm deduces additional variables at zero level until either a constraint is violated (the IP is infeasible), or no more variables can be deduced zero (the IP is undecided). All feasible IPs, and all infeasible IPs not detected infeasible are undecided. We successfully apply the algorithm to a small set of specially formulated infeasible zero-one IP instances of the Hamilton cycle decision problem. We show how to model both the graph and subgraph isomorphism decision problems for input to the algorithm. Increased levels of nested doubly stochastic subsystems can be implemented dynamically. The algorithm is designed for parallel processing, and for inclusion of techniques in addition to matching.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。