Sciweavers

925 search results - page 31 / 185
» A Solution to the Extended GCD Problem
Sort
View
TCS
2008
13 years 7 months ago
Solving NP-complete problems in the tile assembly model
Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
Yuriy Brun
SIAMJO
2002
77views more  SIAMJO 2002»
13 years 7 months ago
Modifying SQP for Degenerate Problems
Most local convergence analyses of the sequential quadratic programming (SQP) algorithm for nonlinear programming make strong assumptions about the solution, namely, that the activ...
Stephen J. Wright
COR
2006
99views more  COR 2006»
13 years 7 months ago
Waste collection vehicle routing problem with time windows
In this paper, we address a real life waste collection vehicle routing problem with time windows (VRPTW) with consideration of multiple disposal trips and drivers' lunch brea...
Byung-In Kim, Seongbae Kim, Surya Sahoo
TCS
2008
13 years 7 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman
CCO
2001
Springer
168views Combinatorics» more  CCO 2001»
14 years 8 days ago
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
Yves Pochet