1647 search results - page 184 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
165
Voted
IJCAI
2003
15 years 6 months ago
2003
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
297
click to vote
OL
2011
14 years 12 months ago
2011
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
158
Voted
ALGORITHMICA
2011
15 years 2 days ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
148
Voted
SPIRE
2010
Springer
15 years 3 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
151
click to vote
SSIAI
2002
IEEE
15 years 10 months ago
2002
IEEE
Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is pres...