2109 search results - page 59 / 422 » Solving Necklace Constraint Problems |
122
click to vote
ANOR
2002
15 years 4 months ago
2002
Abstract. This paper presents a hybridization of a Constraint Programming (CP) model and search techniques with Local Search (LS) and some ideas borrowed from Genetic Algorithms (G...
134
click to vote
DISOPT
2008
15 years 4 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
107
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We consider the problem of minimizing the cost of the power required to achieve a specified level of quality-of-service (QoS) on a point-to-point link that may be assisted by an ...
140
Voted
CPAIOR
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at t...
135
Voted
ICDM
2009
IEEE
15 years 2 months ago
2009
IEEE
Efficient acquisition of constraint networks is a key factor for the applicability of constraint problem solving methods. Current techniques ease knowledge acquisition by generati...