2100 search results - page 58 / 420 » Fundamentals of the problem |
180
click to vote
JMMA
2002
15 years 5 months ago
2002
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
165
click to vote
SIAMJO
2010
15 years 4 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
157
click to vote
COR
2008
15 years 5 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
195
click to vote
ICCSA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a parallel approach for optimizing surface meshes by redistributing vertices on a feature-aware higher-order reconstruction of a triangulated surface. Our meth...
126
click to vote
AAAI
2006
15 years 7 months ago
2006
Symmetry in constraint satisfaction problems (CSPs) has been considered in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or as an o...