The shortest path problem with two objective functions
type: Item
instance of: scholarly article
title: The shortest path problem with two objective functions
zbMATH Open document ID: 0594.90087
DOI: 10.1016/0377-2217(86)90092-5
author: Mordecai Henig
published in: European Journal of Operational Research
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 91B16
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 3956840
zbMATH Keywords: two objective functions
zbMATH Keywords: shortest path in a network
zbMATH Keywords: nondominated paths
zbMATH Keywords: quasiconvex utility functions
zbMATH Keywords: branch and bound
MaRDI profile type: Publication
full work available at URL: 0377-2217(86)90092-5
OpenAlex ID: W1998132337
cites work: Q3932576
cites work: Q3241581
cites work: Dynamic programming in multiplicative lattices
cites work: A bicriterion shortest path algorithm
cites work: Note on Multiple Objective Dynamic Programming
cites work: Q5588318
cites work: Contraction Mappings in the Theory Underlying Dynamic Programming
cites work: Q5615833
cites work: Q3888874
cites work: Validity of Local Search in Multiparametric and Vector Linear Programming
cites work: Q3048571
cites work: Combinatorial Optimization with Rational Objective Functions
cites work: Preference Order Dynamic Programming
cites work: Sur L'enveloppe convexe des nuages de points aleatoires dans Rn. I
cites work: Ordinal Dynamic Programming
cites work: Multidimensional Line Search Using a Binary Preference Relation
Recommended article: A multi-objective shortest path problem
Recommended article: Two-phase algorithms for the parametric shortest path problem
Recommended article: The Steiner bi-objective shortest path problem
Recommended article: The tricriterion shortest path problem with at least two bottleneck objective functions
Recommended article: The undirected two disjoint shortest paths problem
Recommended article: Q3170934
Recommended article: On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
Recommended article: Shortest paths with shortest detours. A biobjective routing problem
Recommended article: An interactive approach to identify the best compromise solution for two objective shortest path problems
description: scientific article; zbMATH DE number 3956840