4066 search results - page 160 / 814 » Almost Complete Sets |
152
click to vote
DISOPT
2008
15 years 6 months ago
2008
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 ...
173
click to vote
SIBGRAPI
2005
IEEE
16 years 20 hour ago
2005
IEEE
Mathematical morphology was originally conceived as a set theoretic approach for the processing of binary images. Approaches that extend classical binary morphology to gray-scale ...
162
click to vote
ICNC
2005
Springer
15 years 12 months ago
2005
Springer
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem，and the solution can be reduced to determining the minimal co...
158
click to vote
LPNMR
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
141
click to vote
4OR
2005
15 years 6 months ago
2005
Shepherd (1995) proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet s...