28 search results - page 4 / 6 » Optimizing Designs Containing Black Boxes |
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
With this work we aim to make a three-fold contribution. We first address the issue of supporting efficiently queries over string-attributes involving prefix, suffix, containmen...
MP
2010
13 years 2 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
CCO
2001
Springer
14 years 5 days ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
ANOR
2004
13 years 7 months ago
2004
Accurate knowledge of the effect of parameter uncertainty on process design and operation is essential for optimal and feasible operation of a process plant. Existing approaches de...
DOLAP
2009
ACM
14 years 2 months ago
2009
ACM
Extract-Transform-Load (ETL) activities are software modules responsible for populating a data warehouse with operational data, which have undergone a series of transformations on...