Pages that link to "Item:Q1827279"
From MaRDI portal
The following pages link to The non-approximability of bicriteria network design problems (Q1827279):
Displaying 5 items.
- The density maximization problem in graphs (Q386420) (← links)
- Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives (Q1877893) (← links)
- Exact approaches for the minimum subgraph diameter problem (Q2108148) (← links)
- Bicriteria Network Design Problems (Q4216149) (← links)
- Bicriterion discrete equilibrium network design problem (Q4642480) (← links)