Pages that link to "Item:Q4836774"
From MaRDI portal
The following pages link to Combinational optimization problems for which almost every algorithm is asymptotically optimal (Q4836774):
Displaying 10 items.
- Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem (Q628662) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Random assignment problems (Q953417) (← links)
- Posterior agreement for large parameter-rich optimization problems (Q1786589) (← links)
- Uncertain programming model for uncertain optimal assignment problem (Q1788760) (← links)
- A note on the asymptotic behaviour of bottleneck problems (Q2488222) (← links)
- An asymptotical study of combinatorial optimization problems by means of statistical mechanics (Q2571224) (← links)
- Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
- Quadratic bottleneck problems (Q5392805) (← links)
