A preference-based approach to spanning trees and shortest paths problems
From MaRDI portal
Publication:704097
Recommendations
Cites work
- scientific article; zbMATH DE number 5842432 (Why is no real title available?)
- scientific article; zbMATH DE number 4147534 (Why is no real title available?)
- scientific article; zbMATH DE number 4070651 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 3514748 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A multicriteria Pareto-optimal path algorithm
- A parametric approach to solving bicriterion shortest path problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Algebraic and combinatorial methods in operations research. Proceedings of the Workshop on Algebraic Structures in Operations Research
- An improved general procedure for lexicographic bottleneck problems
- Arbres minimaux d'un graphe preordonne
- Choice functions, rationality conditions, and variations on the weak axiom of revealed preference
- Design of an Optimal Sequence of Interrelated Sampling Plans
- Efficient spanning trees
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- Linear and combinatorial optimization in ordered algebraic structures
- Minimal paths on ordered graphs
- Monotonicity and the principle of optimality
- Multicriteria optimization
- Multiobjective A*
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- Multiobjective, preference-based search in acyclic OR-graphs
- Multi‐objective combinatorial optimization problems: A survey
- On a multicriteria shortest path problem
- On spanning tree problems with multiple objectives
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- On the robust shortest path problem.
- Partial order bounding: A new approach to evaluation in game tree search
- Robust discrete optimization and its applications
- Searching game trees under a partial order
- Semiorders. Properties, representations, applications
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- Some aspects of the general theory of best option choice
- The problem of the optimal biobjective spanning tree
Cited in
(21)- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- Optimising a nonlinear utility function in multi-objective integer programming
- Choquet-based optimisation in multiobjective shortest path and spanning tree problems
- Finding socially best spanning treesî
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Computer science and decision theory
- Randomized self-stabilizing leader election in preference-based anonymous trees
- The traveling group problem
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms
- Extensions of labeling algorithms for multi-objective uncertain shortest path problems
- Two‐phase strategies for the bi‐objective minimum spanning tree problem
- The solution and duality of imprecise network problems
- Shortest paths with ordinal weights
- Kruskal with embedded c-semirings to solve MST problems with partially-ordered costs
- Ranking function-based solutions of fully fuzzified minimal cost flow problem
- Empirical study of exact algorithms for the multi-objective spanning tree
- A Survey on Multiple Objective Minimum Spanning Tree Problems
- Optimality conditions in preference-based spanning tree problems
- Generalized minimal cost flow problem in fuzzy nature: an application in bus network planning problem
- A lower bound of the Choquet integral integrated within martins' algorithm
- Combinatorial algorithms for the minimum interval cost flow problem
This page was built for publication: A preference-based approach to spanning trees and shortest paths problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704097)
