Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems

DOI10.1287/MNSC.40.7.891MaRDI QIDQ4319535zbMATH OpenOpenAlexFDO

Authors Mordecai Henig

Publication date 11 January 1995

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.40.7.891

zbMATH Keywords

acyclic networkinteractive programmingmultiattribute utilitymultiple criteria decision analysismultiple criteria dynamic programmingpreference-order relation on paths

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Recommendations

• The interactive analysis of the multicriteria shortest path problem by the reference point method.
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• Routing with nonlinear multiattribute cost functions
• An extended shortest path problem: a data envelopment analysis approach
• Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points

Cited in

(12)

• Low earth orbit satellite based communication systems -- research opportunities
• The interactive analysis of the multicriteria shortest path problem by the reference point method.
• The fuzzy shortest path length and the corresponding shortest path in a network
• A general decomposition approach for multi-criteria decision trees
• Maximum probabilistic all-or-nothing paths
• Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• An extended shortest path problem: a data envelopment analysis approach
• Fuzzy shortest path problem based on level \(\lambda\)-triangular LR fuzzy numbers
• An interactive approach to identify the best compromise solution for two objective shortest path problems
• Optimal paths in bi-attribute networks with fractional cost functions

This page was built for publication: Efficient Interactive Methods for a Class of Multiattribute Shortest Path Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4319535)