Pages that link to "Item:Q3883859"
From MaRDI portal
The following pages link to Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem (Q3883859):
Displaying 15 items.
- Measuring the impact of MVC attack in large complex networks (Q506775) (← links)
- On nonlinear multi-covering problems (Q511715) (← links)
- Phylogenetic diversity and the maximum coverage problem (Q735104) (← links)
- Meaningfulness of conclusions from combinatorial optimization (Q750310) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- On interval and circular-arc covering problems (Q2327673) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- Product line selection and pricing analysis: impact of genetic relaxations (Q2489113) (← links)
- Improved approximation of maximum vertex cover (Q2583713) (← links)
- A Probabilistic Analysis of the K-Location Problem (Q3136634) (← links)
- The asymptotic probabilistic behaviour of quadratic sum assignment problems (Q3668301) (← links)
- A Canonical Representation of Simple Plant Location Problems and Its Applications (Q3967331) (← links)
- (Q5002791) (← links)
- (Q5009574) (← links)