An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
From MaRDI portal
Publication:1304515
DOI10.1016/S0305-0548(98)00094-XzbMath0932.90005OpenAlexW2003846304MaRDI QIDQ1304515
John R. Current, J. M. Coutinho-Rodrigues, Joao Carlos Namorado Climaco
Publication date: 22 September 1999
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00094-x
Related Items (18)
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs ⋮ Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach ⋮ Computing all efficient solutions of the biobjective minimum spanning tree problem ⋮ Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: a heuristic solution ⋮ Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms ⋮ A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ A bi-objective modeling approach applied to an urban semi-desirable facility location problem ⋮ The interactive analysis of the multicriteria shortest path problem by the reference point method. ⋮ Optimal paths in bi-attribute networks with fractional cost functions ⋮ A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes ⋮ A new multiobjective dynamic routing method for multiservice networks: modelling and performance ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Finding the \(K\) shortest hyperpaths ⋮ On a bi-dimensional dynamic alternative routing method ⋮ The determination of the path with minimum-cost norm value ⋮ Label correcting methods to solve multicriteria shortest path problems ⋮ Efficiently Generating k-Best Solutions to Procurement Auctions
This page was built for publication: An interactive bi-objective shortest path approach: Searching for unsupported nondominated solutions
