36 search results - page 3 / 8 » A Shadow Simplex Method for Infinite Linear Programs |
ML
2002
ACM
13 years 5 months ago
2002
ACM
We examine methods for constructing regression ensembles based on a linear program (LP). The ensemble regression function consists of linear combinations of base hypotheses generat...
ICASSP
2010
IEEE
13 years 6 months ago
2010
IEEE
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
EOR
2007
13 years 5 months ago
2007
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
SODA
1998
ACM
13 years 7 months ago
1998
ACM
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...