4118 search results - page 13 / 824 » Efficient Algorithms for Airline Problem |
DATE
2000
IEEE
15 years 1 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
ESA
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
AAIM
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
82
Voted
SIAMSC
2010
14 years 4 months ago
2010
Abstract. We develop in this paper some efficient algorithms which are essential to implementations of spectral methods on the sparse grid by Smolyak's construction based on a...
EVOW
2006
Springer
15 years 1 months ago
2006
Springer
This paper proposes an evolutionary algorithm (EA) that is applied to the traveling salesman problem (TSP). Existing approximation methods to address the TSP known to be state-of-t...