Pages that link to "Item:Q852261"
From MaRDI portal
The following pages link to Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem (Q852261):
Displaying 8 items.
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem (Q628662) (← links)
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596) (← links)
- Asymptotic approach to solving the multi-index axial transportation problem (Q1571197) (← links)
- Resolvability of multi-index axial assignment problem on one-cyclic substitutions (Q1603114) (← links)
- Remark on the paper ``A polynomial algorithm for the multi-index choice problem'' (Q1608246) (← links)
- Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem. (Q1852514) (← links)
- On random multi-dimensional assignment problems (Q2004066) (← links)
- Efficient algorithms for three‐dimensional axial and planar random assignment problems (Q5175234) (← links)