Pages that link to "Item:Q336753"
From MaRDI portal
The following pages link to Looking for edge-equitable spanning trees (Q336753):
Displaying 10 items.
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122) (← links)
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
- Median and covering location problems with interconnected facilities (Q1738812) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- Clustering data that are graph connected (Q1753555) (← links)
- A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
- Inverse single facility location problem on a tree with balancing on the distance of server to clients (Q2076390) (← links)
- Advanced network connectivity features and zonal requirements in covering location problems (Q6047840) (← links)
- The profit-oriented hub line location problem with elastic demand (Q6047874) (← links)
