scientific article
From MaRDI portal
Publication:3863698
zbMath0426.90066MaRDI QIDQ3863698
E. Kh. Gimadi, V. A. Perepelitsa, N. I. Glebov
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
schedulingcombinatorial optimizationtravelling salesmannumerical studyquality of algorithmsasymptotic optimal algorithmstatistically efficient algorithm
Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (10)
Algorithm for the discrete Weber's problem with an accuracy estimate ⋮ A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum ⋮ Generic complexity of the membership problem for semigroups of integer matrices ⋮ Fast probabilistic algorithms for Hamiltonian circuits and matchings ⋮ On asymptotically optimal approach for finding of the minimum total weight of edge-disjoint spanning trees with a given diameter ⋮ Unnamed Item ⋮ ON GENERIC COMPLEXITY OF THE GRAPH CLUSTERING PROBLEM ⋮ The generic complexity of the bounded problem of graphs clustering ⋮ The generic complexity of the graph triangulation problem ⋮ On asymptotically optimal approach for the problem of finding several edge-disjoint spanning trees of given diameter in an undirected graph with random edge weights
This page was built for publication:
