Pages that link to "Item:Q4216149"
From MaRDI portal
The following pages link to Bicriteria Network Design Problems (Q4216149):
Displayed 10 items.
- The constrained minimum spanning tree problem (Q5054807) (← links)
- Bicriteria Data Compression (Q5242925) (← links)
- An exact method for solving the bi-objective Minimum Diameter-Cost Spanning Tree Problem (Q5247677) (← links)
- Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones (Q5502177) (← links)
- Realization problems on reachability sequences (Q5925515) (← links)
- Improved approximations for buy-at-bulk and shallow-light \(k\)-Steiner trees and \((k,2)\)-subgraph (Q5963643) (← links)
- Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)
- Compact location problems with budget and communication constraints (Q6064048) (← links)
- Complexity and approximability of certain bicriteria location problems (Q6122213) (← links)
- On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)