3221 search results - page 156 / 645 » Termination of Linear Programs |
167
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
148
click to vote
VLSID
2007
IEEE
16 years 6 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
138
click to vote
CPAIOR
2005
Springer
15 years 12 months ago
2005
Springer
Creating good integer programming formulations had, as a basic axiom, the rule “Find formulations with tighter linear relaxations”. This rule, while useful when using unsophist...
166
click to vote
SIAMJO
2000
15 years 6 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
168
click to vote
FLOPS
2010
Springer
15 years 4 months ago
2010
Springer
Injectivity is one of the important properties for functions while it is undecidable in general and decidable for linear treeless functions. In this paper, we show new sufficient c...