Sciweavers

839 search results - page 3 / 168
» Three-Clustering of Points in the Plane
Sort
View
EOR
2010
140views more  EOR 2010»
13 years 5 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
FFA
2008
260views more  FFA 2008»
13 years 7 months ago
On the isotopism classes of finite semifields
A projective plane is called a translation plane if there exists a line L such that the group of elations with axis L acts transitively on the points not on L. A translation plane...
Michel Lavrauw
COMGEO
2012
ACM
12 years 3 months ago
Point-set embeddings of plane 3-trees
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
Rahnuma Islam Nishat, Debajyoti Mondal, Md. Saidur...
SIAMJO
2010
130views more  SIAMJO 2010»
13 years 2 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...
JCT
2011
56views more  JCT 2011»
13 years 2 months ago
On the structure of 3-nets embedded in a projective plane
We investigate finite 3-nets embedded in a projective plane over a (finite or infinite) field of any characteristic p. Such an embedding is regular when each of the three clas...
Aart Blokhuis, Gábor Korchmáros, Fra...