Sciweavers

985 search results - page 3 / 197
» Piercing Convex Sets
Sort
View
MP
2010
100views more  MP 2010»
14 years 8 months ago
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
In this paper, we develop a convexification tool that enables the construction of convex hulls for orthogonal disjunctive sets using convex extensions and disjunctive programming...
Mohit Tawarmalani, Jean-Philippe P. Richard, Kwang...
CORR
2002
Springer
93views Education» more  CORR 2002»
14 years 9 months ago
On the Reflexivity of Point Sets
We introduce a new measure for planar point sets S that captures a combinatorial distance that S is from being a convex set: The reflexivity (S) of S is given by the smallest numb...
Esther M. Arkin, Sándor P. Fekete, Ferran H...
EUSFLAT
2007
118views Fuzzy Logic» more  EUSFLAT 2007»
14 years 11 months ago
Algorithms for the Construction of Digital Convex Fuzzy Hulls
We consider a digital fuzzy set placed in Oxyplane, with support which is a set of digital points (centroids) in Z2 . We consider two kinds of convexity of a fuzzy set, namely qua...
Nebojsa M. Ralevic, Lidija Comic
MOR
2010
99views more  MOR 2010»
14 years 8 months ago
An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
Kent Andersen, Quentin Louveaux, Robert Weismantel
ACMSE
2010
ACM
14 years 4 months ago
Learning to rank using 1-norm regularization and convex hull reduction
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Xiaofei Nan, Yixin Chen, Xin Dang, Dawn Wilkins