Pages that link to "Item:Q1162147"
From MaRDI portal
The following pages link to Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations (Q1162147):
Displayed 6 items.
- On the expected optimal value of random assignment problems: Experimental results and open questions (Q1315447) (← links)
- Some recent results in the analysis of greedy algorithms for assignment problems (Q1317524) (← links)
- Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms (Q1338142) (← links)
- The asymptotic probabilistic behaviour of quadratic sum assignment problems (Q3668301) (← links)
- Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem (Q3730367) (← links)
- Complexity of discrete multicriteria problems (Q4836160) (← links)