The following pages link to Efficient spanning trees (Q796551):
Displaying 16 items.
- Finding all nondominated points of multi-objective integer programs (Q377734) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- A preference-based approach to spanning trees and shortest paths problems (Q704097) (← links)
- On spanning tree problems with multiple objectives (Q1339178) (← links)
- Computation of ideal and Nadir values and implications for their use in MCDM methods. (Q1406960) (← links)
- A new approach for the multiobjective minimum spanning tree (Q1651644) (← links)
- The problem of the optimal biobjective spanning tree (Q1806877) (← links)
- Finding multi-objective supported efficient spanning trees (Q2028494) (← links)
- A multi-agent transgenetic algorithm for the bi-objective spanning tree problem (Q2132380) (← links)
- Empirical study of exact algorithms for the multi-objective spanning tree (Q2301151) (← links)
- A survey of recent developments in multiobjective optimization (Q2468335) (← links)
- An exact method to generate all nondominated spanning trees (Q2954355) (← links)
- A Survey on Multiple Objective Minimum Spanning Tree Problems (Q3637314) (← links)
- Balancing profits and costs on trees (Q5326788) (← links)
- Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
- On solving bi-objective constrained minimum spanning tree problems (Q6166107) (← links)
