Sciweavers

55 search results - page 7 / 11
» Linear Programming Boosting via Column Generation
Sort
View
DAC
2009
ACM
14 years 6 days ago
GRIP: scalable 3D global routing using integer programming
We propose GRIP, a scalable global routing technique via Integer Programming (IP). GRIP optimizes wirelength and via cost without going through a layer assignment phase. GRIP sele...
Tai-Hsuan Wu, Azadeh Davoodi, Jeffrey T. Linderoth
ENDM
2010
101views more  ENDM 2010»
13 years 7 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
ML
2002
ACM
127views Machine Learning» more  ML 2002»
13 years 7 months ago
Sparse Regression Ensembles in Infinite and Finite Hypothesis Spaces
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...
Gunnar Rätsch, Ayhan Demiriz, Kristin P. Benn...
CONSTRAINTS
2008
117views more  CONSTRAINTS 2008»
13 years 7 months ago
Domain Specific High-Level Constraints for User Interface Layout
We present the Auckland Layout Model (ALM), a constraint-based technique for specifying 2D layout as it is used for arranging the controls in a GUI. Most GUI frameworks offer layo...
Christof Lutteroth, Robert Strandh, Gerald Weber
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke