๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Weighted hypertree decompositions and optimal query plans

โœ Scribed by Francesco Scarcello; Gianluigi Greco; Nicola Leone

Book ID
108166520
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
497 KB
Volume
73
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Hypertree Decompositions and Tractable Q
Hypertree Decompositions and Tractable Queries
โœ Georg Gottlob; Nicola Leone; Francesco Scarcello ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 368 KB

Several important decision problems on conjunctive queries (CQs) are NP-complete in general but become tractable, and actually highly parallelizable, if restricted to acyclic or nearly acyclic queries. Examples are the evaluation of Boolean CQs and query containment. These problems were shown tracta

Capacity expansion planning through augm
Capacity expansion planning through augmented Lagrangian optimization and scenario decomposition
โœ Zukui Li; Marianthi G. Ierapetritou ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› American Institute of Chemical Engineers ๐ŸŒ English โš– 885 KB

## Abstract Stochastic programming is a typical method for addressing the uncertainties in capacity expansion planning problem. However, the corresponding deterministic equivalent model is often intractable with considerable number of uncertainty scenarios especially for stochastic integer programm