Sciweavers

9 search results - page 2 / 2
» Compact formulations as a union of polyhedra
Sort
View
IPCO
2010
231views Optimization» more  IPCO 2010»
13 years 6 months ago
Branched Polyhedral Systems
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
Volker Kaibel, Andreas Loos
IPPS
2007
IEEE
13 years 11 months ago
Scheduling in the Z-Polyhedral Model
The polyhedral model is extensively used for analyses and transformations of regular loop programs, one of the most important being automatic parallelization. The model, however, ...
Gautam Gupta, DaeGon Kim, Sanjay V. Rajopadhye
DISOPT
2008
81views more  DISOPT 2008»
13 years 5 months ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...
ICDT
2010
ACM
211views Database» more  ICDT 2010»
14 years 2 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis