Probabilistic analysis of an algorithm for the m-planar 3-index assignment problem on single-cycle permutations on one-cycle permutations
DOI10.1134/S1990478914020070zbMATH Open1324.90106OpenAlexW2020455290MaRDI QIDQ5264723FDOQ5264723
Authors: Eh. Kh. Gimadi, O. Yu. Tsidulko, Yu. V. Glazkov 
Publication date: 27 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478914020070
Recommendations
- An asymptotically exact algorithm for one modification of planar three-index assignment
- Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above
- An algorithm for the planar three-index assignment problem
- On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem
- An asymptotically optimal algorithm for the \(m\)-peripatetic salesman problem on random inputs with discrete distribution
asymptotic optimality\(m\)-planar 3-dimensional assignment problem\(m\)-PSP with different weight functionsone-cycle permutationpolynomial approximation algorithm
Cited In (4)
- An asymptotically exact algorithm for one modification of planar three-index assignment
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
- Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above
- An asymptotically optimal algorithm for the m-Peripatetic Salesman Problem on random inputs with discrete distribution
This page was built for publication: Probabilistic analysis of an algorithm for the \(m\)-planar 3-index assignment problem on single-cycle permutations on one-cycle permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264723)
