Pages that link to "Item:Q1067976"
From MaRDI portal
The following pages link to Probabilistic asymptotic properties of some combinatorial optimization problems (Q1067976):
Displaying 18 items.
- Asymptotic behavior of the quadratic knapsack problem (Q323537) (← links)
- Discrete optimization: an Austrian view (Q537581) (← links)
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem (Q628662) (← links)
- The random quadratic assignment problem (Q658428) (← links)
- Selected topics on assignment problems (Q697571) (← links)
- Random assignment problems (Q953417) (← links)
- Probabilistic estimates for the generalized maximum satisfiability problem (Q1327226) (← links)
- Uncertain programming model for uncertain optimal assignment problem (Q1788760) (← links)
- OR Utopia (Q1806727) (← links)
- Local search with memory: Benchmarking RTS (Q1908991) (← links)
- A linear ordering problem of sets (Q2173116) (← 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)
- Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck (Q3200892) (← links)
- Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs (Q3705237) (← links)
- Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
- Combinational optimization problems for which almost every algorithm is asymptotically optimal (Q4836774) (← links)
- The Random QUBO (Q5050147) (← links)
