A bicriterion shortest path algorithm (Q1166423)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A bicriterion shortest path algorithm	scientific article

Statements

scholarly article

0 references

A bicriterion shortest path algorithm (English)

0 references

Joao Carlos Namorado Climaco

0 references

Ernesto Queirós Vieira Martins

0 references

European Journal of Operational Research

0 references

publication date

1982

0 references

zbMATH Keywords

bicriterion shortest path algorithm

0 references

Pareto optimal paths

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0377-2217(82)90205-3

0 references

A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees

0 references

A note on two problems in connexion with graphs

0 references

0 references

Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon

0 references

A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem

0 references

0 references

Linear multiobjective programming

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/0377-2217(82)90205-3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1166423

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1166423&oldid=34670116"