Pages that link to "Item:Q1183333"
From MaRDI portal
The following pages link to An \(\varepsilon\)-approximation scheme for combinatorial optimization problems with minimum variance criterion (Q1183333):
Displaying 9 items.
- The balanced traveling salesman problem (Q614063) (← links)
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334) (← links)
- Minimum dispersion problems (Q1363766) (← links)
- Constrained balanced optimization problems (Q1963024) (← links)
- The quadratic balanced optimization problem (Q2339810) (← links)
- AN ε-APPROXIMATION SCHEME FOR MINIMUM VARIANCE PROBLEMS (Q3197622) (← links)
- Generalized Bottleneck Problems<sup>∗</sup> (Q4859828) (← links)
- The Rank-One Quadratic Assignment Problem (Q5085471) (← links)