The following pages link to Hans-Christoph Wirth (Q214963):
Displaying 24 items.
- (Q169298) (redirect page) (← links)
- Optimizing cost flows by edge cost and capacity upgrade (Q876725) (← links)
- Multiple voting location and single voting location on trees (Q877040) (← links)
- Relaxed voting and competitive location under monotonous gain functions on trees (Q968153) (← links)
- An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees (Q976129) (← links)
- Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree (Q1026238) (← links)
- \((r,p)\)-centroid problems on paths and trees (Q1034634) (← links)
- On the minimum label spanning tree problem (Q1567494) (← links)
- On the flow cost lowering problem (Q1600835) (← links)
- (Q1960522) (redirect page) (← links)
- Improving spanning trees by upgrading nodes (Q1960523) (← links)
- (Q2766675) (← links)
- (Q4232790) (← links)
- (Q4414508) (← links)
- (Q4448759) (← links)
- (Q4494412) (← links)
- Improving spanning trees by upgrading nodes (Q4571960) (← links)
- (Q4789852) (← links)
- Improving Minimum Cost Spanning Trees by Upgrading Nodes (Q4939607) (← links)
- (Q4944966) (← links)
- (Q4944969) (← links)
- Upgrading bottleneck constrained forests (Q5928872) (← links)
- Reload cost problems: Minimum diameter spanning tree (Q5948962) (← links)
- Euler is standing in line dial-a-ride problems with precedence-constraints (Q5948963) (← links)
