33 search results - page 2 / 7 » Improving Constraint-Based Testing with Dynamic Linear Relax... |
ITC
2003
IEEE
13 years 10 months ago
2003
IEEE
As the performance of Analog-to-Digital Converters continues to improve, it is becoming more challenging and costly to develop sufficiently fast and low-drift signal generators th...
COCOA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
HEURISTICS
2008
13 years 5 months ago
2008
In this article we investigate a new variant of Variable Neighborhood Search (VNS): Relaxation Guided Variable Neighborhood Search. It is based on the general VNS scheme and a new...
ICRA
1998
IEEE
13 years 9 months ago
1998
IEEE
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
MP
2010
12 years 11 months ago
2010
We consider the single item lot-sizing problem with capacities that are non-decreasing over time. When the cost function is i) non-speculative or Wagner-Whitin (for instance, cons...