A study of search algorithms’ optimization speed (English)
- New search for: Valsecchi, Andrea
- New search for: Vanneschi, Leonardo
- New search for: Mauri, Giancarlo
- New search for: Valsecchi, Andrea
- New search for: Vanneschi, Leonardo
- New search for: Mauri, Giancarlo
In:
Journal of Combinatorial Optimization
;
27
, 2
; 256-270
;
2012
-
ISSN:
- Article (Journal) / Print
-
Title:A study of search algorithms’ optimization speed
-
Contributors:
-
Published in:Journal of Combinatorial Optimization ; 27, 2 ; 256-270
-
Publisher:
- New search for: Springer US
- New search for: Springer Science + Business Media
-
Place of publication:Norwell, Mass.
-
Publication date:2012
-
ISSN:
-
ZDBID:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Print
-
Language:English
- New search for: oek 489
- New search for: 31.12 / 31.80
- Further information on Basic classification
-
Keywords:
-
Classification:
-
Source:
Table of contents – Volume 27, Issue 2
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 209
-
Efficient identifications of structural similarities for graphsFang, Zheng / Wang, Jie et al. | 2012
- 221
-
An improved distributed data aggregation scheduling in wireless sensor networksLi, Deying / Zhu, Qinghua / Du, Hongwei / Li, Jianzhong et al. | 2012
- 241
-
Signed Roman domination in graphsAbdollahzadeh Ahangar, H. / Henning, Michael A. / Löwenstein, Christian / Zhao, Yancai / Samodivkin, Vladimir et al. | 2012
- 256
-
A study of search algorithms’ optimization speedValsecchi, Andrea / Vanneschi, Leonardo / Mauri, Giancarlo et al. | 2012
- 271
-
Sharp bounds of the Zagreb indices of k-treesEstes, John / Wei, Bing et al. | 2012
- 292
-
Generalized perfect domination in graphsChaluvaraju, B. / Vidya, K. A. et al. | 2012
- 302
-
An efficient FPRAS type group testing procedure to approximate the number of defectivesCheng, Yongxi / Xu, Yinfeng et al. | 2012
- 315
-
Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problemsXu, Zi / Du, Donglei / Xu, Dachuan et al. | 2012
- 328
-
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercubeKung, Tzu-Liang / Lin, Cheng-Kuan / Hsu, Lih-Hsing et al. | 2012
- 345
-
Boundary graph classes for some maximum induced subgraph problemsMalyshev, Dmitriy S. et al. | 2012
- 355
-
Circular L(j,k)-labeling number of direct product of path and cycleWu, Qiong / Shiu, Wai Chee / Sun, Pak Kiu et al. | 2012
- 369
-
Total and paired domination numbers of toroidal meshesHu, Fu-Tao / Xu, Jun-Ming et al. | 2012
- 379
-
The adjacent vertex distinguishing total coloring of planar graphsWang, Weifan / Huang, Danjun et al. | 2012
- 397
-
Improvements to MCS algorithm for the maximum clique problemBatsyn, Mikhail / Goldengorin, Boris / Maslov, Evgeny / Pardalos, Panos M. et al. | 2013