An interactive approach to identify the best compromise solution for two objective shortest path problems
DOI10.1016/0305-0548(90)90042-6zbMath0698.90084OpenAlexW2025640489MaRDI QIDQ912767
Jared L. Cohon, John R. Current, Charles S. Re Velle
Publication date: 1990
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(90)90042-6
decision makingshortest pathinteractive methodtwo objectivesnoninferior set estimationnoninferior solution set
Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50)
Related Items (18)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On a multicriteria shortest path problem
- The shortest path problem with two objective functions
- Multiobjective programming and planning
- A bicriterion shortest path algorithm
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
- Shortest-path algorithms: Taxonomy and annotation
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- An efficient algorithm for K shortest simple paths
- An Interactive Programming Method for Solving the Multiple Criteria Problem
- Deterministic network optimization: A bibliography
This page was built for publication: An interactive approach to identify the best compromise solution for two objective shortest path problems