A preference-based approach to spanning trees and shortest paths problems
From MaRDI portal
Publication:704097
DOI10.1016/j.ejor.2003.12.013zbMath1065.90064OpenAlexW2123508631MaRDI QIDQ704097
Olivier Spanjaard, Patrice Perny
Publication date: 12 January 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.12.013
Related Items (20)
Generalized minimal cost flow problem in fuzzy nature: an application in bus network planning problem ⋮ The traveling group problem ⋮ Ranking function-based solutions of fully fuzzified minimal cost flow problem ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Finding socially best spanning treesî ⋮ Optimising a nonlinear utility function in multi-objective integer programming ⋮ RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES ⋮ The solution and duality of imprecise network problems ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms ⋮ Combinatorial algorithms for the minimum interval cost flow problem ⋮ Computer science and decision theory ⋮ Extensions of labeling algorithms for multi‐objective uncertain shortest path problems ⋮ Kruskal with embedded C-semirings to solve MST problems with partially-ordered costs ⋮ 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 ⋮ A Lower Bound of the Choquet Integral Integrated Within Martins’ Algorithm ⋮ Shortest paths with ordinal weights
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a multicriteria shortest path problem
- Algebraic and combinatorial methods in operations research. Proceedings of the Workshop on Algebraic Structures in Operations Research
- Efficient spanning trees
- A parametric approach to solving bicriterion shortest path problems
- Arbres minimaux d'un graphe preordonne
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- Some aspects of the general theory of best option choice
- Linear and combinatorial optimization in ordered algebraic structures
- A multicriteria Pareto-optimal path algorithm
- Multiobjective, preference-based search in acyclic OR-graphs
- Choice functions, rationality conditions, and variations on the weak axiom of revealed preference
- An improved general procedure for lexicographic bottleneck problems
- On spanning tree problems with multiple objectives
- Robust discrete optimization and its applications
- Semiorders. Properties, representations, applications
- On the robust shortest path problem.
- Multicriteria optimization
- The problem of the optimal biobjective spanning tree
- Genetic algorithm approach on multi-criteria minimum spanning tree problem
- Monotonicity and the principle of optimality
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- Searching game trees under a partial order
- Multiobjective A*
- Multi‐objective combinatorial optimization problems: A survey
- Design of an Optimal Sequence of Interrelated Sampling Plans
- Partial order bounding: A new approach to evaluation in game tree search
This page was built for publication: A preference-based approach to spanning trees and shortest paths problems
