Pages that link to "Item:Q1067976"
From MaRDI portal
The following pages link to Probabilistic asymptotic properties of some combinatorial optimization problems (Q1067976):
Displaying 28 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)
- On a class of optimization problems with no ``efficiently computable'' solution (Q2628942) (← links)
- Estimates for the Syracuse problem via a probabilistic model (Q2752956) (← links)
- On the complexity of nonoverlapping multivariate marginal bounds for probabilistic combinatorial optimization problems (Q2892221) (← links)
- Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck (Q3200892) (← links)
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points (Q3448848) (← links)
- Asymptotics of two integrals from optimization theory and geometric probability (Q3696103) (← links)
- Heuristically determining cliques of given cardinality and with minimal cost within weighted complete graphs (Q3705237) (← links)
- Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems (Q4497873) (← links)
- Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds (Q4652001) (← links)
- Combinational optimization problems for which almost every algorithm is asymptotically optimal (Q4836774) (← links)
- The Random QUBO (Q5050147) (← links)
- (Q5184673) (← links)
- Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space (Q5749151) (← links)
- Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs (Q6621859) (← links)