3663 search results - page 120 / 733 » Problems in the ontology of computer programs |
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
ICTAI
2010
IEEE
14 years 8 months ago
2010
IEEE
We introduce a new plan repair method for problems cast as Mixed Integer Programs. In order to tackle the inherent complexity of these NP-hard problems, our approach relies on the ...
PARA
1995
Springer
15 years 1 months ago
1995
Springer
Coarse grain parallelism inherent in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited in recent research works. However, t...
FSS
2002
14 years 9 months ago
2002
In this work we study approximation of fuzzy functions on a finite set of distinct points. Two types of approximation are considered, one method based on fuzzy linear programming p...