Sciweavers

1723 search results - page 22 / 345
» Cycling in linear programming problems
Sort
View
ICCS
2004
Springer
14 years 3 months ago
Designing Digital Circuits for the Knapsack Problem
Abstract. Multi Expression Programming (MEP) is a Genetic Programming variant that uses linear chromosomes for solution encoding. A unique feature of MEP is its ability of encoding...
Mihai Oltean, Crina Grosan, Mihaela Oltean
JUCS
2008
117views more  JUCS 2008»
13 years 9 months ago
Eliminating Cycles in Weak Tables
: Weak References constitute an elegant mechanism for an application to interact with its garbage collector. In most of its typical uses, weak references are used through weak tabl...
Alexandra Barros, Roberto Ierusalimschy
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 11 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
JMLR
2010
136views more  JMLR 2010»
13 years 4 months ago
High Dimensional Inverse Covariance Matrix Estimation via Linear Programming
This paper considers the problem of estimating a high dimensional inverse covariance matrix that can be well approximated by "sparse" matrices. Taking advantage of the c...
Ming Yuan
CP
2006
Springer
14 years 1 months ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed