Pages that link to "Item:Q704097"
From MaRDI portal
The following pages link to A preference-based approach to spanning trees and shortest paths problems (Q704097):
Displaying 20 items.
- Generalized minimal cost flow problem in fuzzy nature: an application in bus network planning problem (Q838183) (← links)
- The solution and duality of imprecise network problems (Q945182) (← links)
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms (Q976036) (← links)
- Optimality conditions in preference-based spanning tree problems (Q1027614) (← links)
- Optimising a nonlinear utility function in multi-objective integer programming (Q1955541) (← links)
- Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs (Q2032145) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Empirical study of exact algorithms for the multi-objective spanning tree (Q2301151) (← links)
- Shortest paths with ordinal weights (Q2327649) (← links)
- The traveling group problem (Q2385125) (← links)
- Ranking function-based solutions of fully fuzzified minimal cost flow problem (Q2385683) (← links)
- Finding socially best spanning treesî (Q2430005) (← links)
- Combinatorial algorithms for the minimum interval cost flow problem (Q2493698) (← links)
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points (Q2664305) (← links)
- A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm (Q3112556) (← links)
- A Survey on Multiple Objective Minimum Spanning Tree Problems (Q3637314) (← links)
- Extensions of labeling algorithms for multi‐objective uncertain shortest path problems (Q4687213) (← links)
- RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES (Q4902882) (← links)
- Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
- Two‐phase strategies for the bi‐objective minimum spanning tree problem (Q6060666) (← links)
