1064 search results - page 31 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
132
Voted
CAGD
2008
15 years 3 months ago
2008
In this paper a method is presented to fair the limit surface of a subdivision algorithm locally around an extraordinary point. The dominant six eigenvalues of the subdivision mat...
126
Voted
CIE
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
118
click to vote
ISSAC
2005
Springer
15 years 9 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
162
Voted
SIAMJO
2002
15 years 3 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
149
Voted
COCOA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...