Titlebook: Algorithmic Aspects in Information and Management; 10th International C Qianping Gu,Pavol Hell,Boting Yang Conference proceedings 2014 Spri

机会

书目名称Algorithmic Aspects in Information and Management影响因子(影响力)




书目名称Algorithmic Aspects in Information and Management影响因子(影响力)学科排名




书目名称Algorithmic Aspects in Information and Management网络公开度




书目名称Algorithmic Aspects in Information and Management网络公开度学科排名




书目名称Algorithmic Aspects in Information and Management被引频次




书目名称Algorithmic Aspects in Information and Management被引频次学科排名




书目名称Algorithmic Aspects in Information and Management年度引用




书目名称Algorithmic Aspects in Information and Management年度引用学科排名




书目名称Algorithmic Aspects in Information and Management读者反馈




书目名称Algorithmic Aspects in Information and Management读者反馈学科排名

strain

A Hybrid Genetic Algorithm for Solving the Unsplittable Multicommodity Flow Problem: The Maritime Sumparison to a state-of-the-art ant colony system approach is performed based on a real case of maritime surveillance application and some randomly generated instances. The analysis of the results obtained in the two sets was supported by statistical nonparametric Wilcoxon signed-rank tests. The expe

休战

无底

tackle

Virtues

https://doi.org/10.1007/978-3-642-92004-2ted by the minimax problem and the minisum problem, respectively. We study the .-sink location problem in dynamic path networks with continuous model, and prove that the minimax problem can be solved in .(. log.) time and the minisum problem can be solved in .(..) time, where . is the number of vert

adulterant

Algorithmic Aspects in Information and Management978-3-319-07956-1Series ISSN 0302-9743 Series E-ISSN 1611-3349

孵卵器

Recht des Erfinders auf das Patent,the proposed problem, where . is the number of vertices. In this paper, we study the general problem, i.e., minimax regret .-sink location problem in the dynamic path networks. Based on the algorithm for the 1-sink location problem, we design an . time algorithm for the general problem, where . is the number of combination choosing . − 1 from ..

Eosinophils

https://doi.org/10.1007/978-3-642-91904-6ize the makespan subject to the constraint that the total completion time is minimized. We study the model where each machine can have multiple unavailable intervals, but at any time, there is at most one machine unavailable. We show that there is an optimal polynomial time algorithm for this model.

纺织品