On the sum-max bicriterion path problem.
type: Item
instance of: scholarly article
title: On the sum-max bicriterion path problem.
zbMATH Open document ID: 1040.90557
DOI: 10.1016/S0305-0548(98)00036-7
author: P. Fernández
author: B. Pelegrin
published in: Computers \& Operations Research
publication date: 2003-09-07T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1975821
zbMATH Keywords: Bicriteria analysis
zbMATH Keywords: network optimization
zbMATH Keywords: quickest paths
MaRDI profile type: Publication
cites work: The constrained shortest path problem
cites work: Multiobjective routing problems
cites work: An algorithm for finding the \(k\) quickest paths in a network
cites work: The quickest path problem
cites work: On the quickest path problem
cites work: Algorithms for the constrained quickest path problem and the enumeration of quickest paths
cites work: A bicriterion shortest path algorithm
cites work: An interactive approach to identify the best compromise solution for two objective shortest path problems
cites work: Shortest-path algorithms: Taxonomy and annotation
cites work: Shortest path methods: A unifying approach
cites work: Q3888874
cites work: The shortest path problem with two objective functions
cites work: The all-pairs quickest path problem
cites work: A parametric approach to solving bicriterion shortest path problems
cites work: Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)
cites work: Algorithms for the quickest path problem and the enumeration of quickest paths
full work available at URL: s0305-0548(98)00036-7
OpenAlex ID: W2005800228
description: scientific article; zbMATH DE number 1975821