Sciweavers

4860 search results - page 129 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
14 years 3 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
FCT
1991
Springer
14 years 1 months ago
The Complexity of Computing Maximal Word Functions
Maximal word functions occur in data retrieval applications and have connections with ranking problems, which in turn were rst investigated in relation to data compression 21 . By ...
Danilo Bruschi, Giovanni Pighizzini
WSC
2008
14 years 14 days ago
Simulation-based optimization of a complex mail transportation network
The Swedish Postal Services receives and distributes over 22 million pieces of mail every day. Mail transportation takes place overnight by airplanes, trains, trucks, and cars in ...
Anna Syberfeldt, Henrik Grimm, Amos Ng, Martin And...
EOR
2008
103views more  EOR 2008»
13 years 10 months ago
New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
Primal-dual Interior-Point Methods (IPMs) have shown their ability in solving large classes of optimization problems efficiently. Feasible IPMs require a strictly feasible startin...
Maziar Salahi, M. Reza Peyghami, Tamás Terl...
ICNC
2005
Springer
14 years 3 months ago
On Evolutionary Optimization of Large Problems Using Small Populations
Abstract. Small populations are very desirable for reducing the required computational resources in evolutionary optimization of complex real-world problems. Unfortunately, the sea...
Yaochu Jin, Markus Olhofer, Bernhard Sendhoff