Sciweavers

47 search results - page 3 / 10
» Computing True Shadow Prices in Linear Programming
Sort
View
ANOR
2008
93views more  ANOR 2008»
13 years 8 months ago
Pruning in column generation for service vehicle dispatching
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
Stephan Westphal, Sven Oliver Krumke
DAC
2009
ACM
14 years 1 months 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
CPAIOR
2007
Springer
14 years 2 months ago
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
Jan-Georg Smaus
BMCBI
2008
80views more  BMCBI 2008»
13 years 8 months ago
Computational evaluation of TIS annotation for prokaryotic genomes
Background: Accurate annotation of translation initiation sites (TISs) is essential for understanding the translation initiation mechanism. However, the reliability of TIS annotat...
Gang-Qing Hu, Xiaobin Zheng, Li-Ning Ju, Huaiqiu Z...
DAC
2005
ACM
13 years 10 months ago
Total power reduction in CMOS circuits via gate sizing and multiple threshold voltages
Minimizing power consumption is one of the most important objectives in IC design. Resizing gates and assigning different Vt’s are common ways to meet power and timing budgets. ...
Feng Gao, John P. Hayes