156 search results - page 13 / 32 » A cutting plane method for solving linear generalized disjun... |
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Learning general functional dependencies is one of the main goals in machine learning. Recent progress in kernel-based methods has focused on designing flexible and powerful input...
INFOCOM
1998
IEEE
13 years 12 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
ICALP
2010
Springer
14 years 13 days ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
STOC
1999
ACM
13 years 12 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...