An interactive procedure using domination cones for bicriterion shortest path problems
From MaRDI portal
Publication:1317170
DOI10.1016/0377-2217(94)90320-4zbMath0790.90074MaRDI QIDQ1317170
Publication date: 23 June 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90320-4
90C35: Programming involving graphs or networks
Related Items
Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms, Label correcting methods to solve multicriteria shortest path problems, Optimal paths in bi-attribute networks with fractional cost functions, On bicriterion minimal spanning trees: An approximation, The interactive analysis of the multicriteria shortest path problem by the reference point method., Multiobjective routing problems, Multicriteria adaptive paths in stochastic, time-varying networks
Cites Work
- Unnamed Item
- The shortest path problem with two objective functions
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- Compromise solutions, domination structures, and Salukvadze's solution
- A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- An Interactive Branch-and-Bound Algorithm for Multiple Criteria Optimization
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
- Interactive solution of bi-criteria mathematical programs
- Linear programming with multiple objective functions: Step method (stem)
- An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
