Sciweavers

MP
2010
94views more  MP 2010»
13 years 9 months ago
MIR closures of polyhedral sets
We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is N...
Sanjeeb Dash, Oktay Günlük, Andrea Lodi
ORL
1998
97views more  ORL 1998»
13 years 10 months ago
The complexity of cover inequality separation
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
Diego Klabjan, George L. Nemhauser, Craig A. Tovey
ESANN
2003
14 years 12 days ago
Neural Net with Two Hidden Layers for Non-Linear Blind Source Separation
In this paper, we present an algorithm that minimizes the mutual information between the outputs of a perceptron with two hidden layers. The neural network is then used as separati...
Rubén Martín-Clemente, Susana Hornil...