427 search results - page 4 / 86 » A Subexponential Bound for Linear Programming |
SAT
2005
Springer
14 years 1 months ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
CP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
NETWORKS
2008
13 years 7 months ago
2008
In a problem arising in grooming for two-period optical networks, it is required to decompose the complete graph on n vertices into subgraphs each containing at most C edges, so t...
MP
2006
13 years 7 months ago
2006
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...