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