A label correcting approach for solving bicriterion shortest-path problems
type: Item
instance of: scholarly article
title: A label correcting approach for solving bicriterion shortest-path problems
zbMATH Open document ID: 0955.90144
DOI: 10.1016/S0305-0548(99)00037-4
author: Anders J. V. Skriver
author: Kim Allan Andersen
published in: Computers \& Operations Research
publication date: 2001-03-04T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 1448731
zbMATH Keywords: MCDM
zbMATH Keywords: MCIP
zbMATH Keywords: bicriterion
zbMATH Keywords: shortest path
zbMATH Keywords: random networks
MaRDI profile type: Publication
cites work: Modeling of transport risk for hazardous materials
cites work: An empirical investigation of some bicriterion shortest path algorithms
cites work: Q3815146
cites work: A bicriterion shortest path algorithm
cites work: A parametric approach to solving bicriterion shortest path problems
cites work: Q3202146
cites work: On bicriterion minimal spanning trees: An approximation
Wikidata QID: Q127350206
full work available at URL: s0305-0548(99)00037-4
OpenAlex ID: W2099466544
description: scientific article; zbMATH DE number 1448731