Sciweavers

13376 search results - page 321 / 2676
» Problem Solving with
Sort
View
IPL
2006
67views more  IPL 2006»
15 years 4 months ago
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs
The Arc-Preserving Subsequence (APS) problem appears in the comparison of RNA structures in computational biology. Given two arcannotated sequences of length n and m < n, APS a...
Peter Damaschke
INFORMS
2010
125views more  INFORMS 2010»
15 years 2 months ago
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
Mike Hewitt, George L. Nemhauser, Martin W. P. Sav...
MP
2002
143views more  MP 2002»
15 years 3 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck
SDM
2009
SIAM
219views Data Mining» more  SDM 2009»
16 years 1 months ago
A Hybrid Data Mining Metaheuristic for the p-Median Problem.
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
RECOMB
2007
Springer
15 years 10 months ago
Parts of the Problem of Polyploids in Rearrangement Phylogeny
Abstract. Genome doubling simultaneously doubles all genetic markers. Genome rearrangement phylogenetics requires that all genomes analyzed have the same set of orthologs, so that ...
Chunfang Zheng, Qian Zhu, David Sankoff