3221 search results - page 135 / 645 » Termination of Linear Programs |
MP
2006
13 years 9 months ago
2006
We introduce strong formulations for robust mixed 0
GECCO
2006
Springer
14 years 1 months ago
2006
Springer
When Genetic Programming is used to evolve arithmetic functions it often operates by composing them from a fixed collection of elementary operators and applying them to parameters...
LOPSTR
2009
Springer
14 years 4 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
ICALP
1997
Springer
14 years 1 months ago
1997
Springer
We prove that, for any fixed k, one can construct a linear time algorithm that checks if a graph has branchwidth≤ k and, if so, outputs a branch decomposition of minimum width....
CADE
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...