2109 search results - page 31 / 422 » Solving Necklace Constraint Problems |
173
click to vote
COR
2008
15 years 3 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
150
click to vote
CADE
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Methods exploiting problem symmetries have been very successful in several areas including constraint programming and SAT solving. We here recast a technique to enhance t...
161
click to vote
CPAIOR
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. We investigate mathematical formulations and solution techniques for a variant of the Connected Subgraph Problem. Given a connected graph with costs and profits associat...
162
click to vote
EAAI
2010
15 years 2 months ago
2010
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
140
click to vote
SMA
2003
ACM
15 years 9 months ago
2003
ACM
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...