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

機(jī)會(huì)

書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)




書目名稱Algorithmic Aspects in Information and Management影響因子(影響力)學(xué)科排名




書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開度




書目名稱Algorithmic Aspects in Information and Management網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Algorithmic Aspects in Information and Management被引頻次




書目名稱Algorithmic Aspects in Information and Management被引頻次學(xué)科排名




書目名稱Algorithmic Aspects in Information and Management年度引用




書目名稱Algorithmic Aspects in Information and Management年度引用學(xué)科排名




書目名稱Algorithmic Aspects in Information and Management讀者反饋




書目名稱Algorithmic Aspects in Information and Management讀者反饋學(xué)科排名

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

休戰(zhàn)

無(wú)底

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.

紡織品