scientific article; zbMATH DE number 4179156

MaRDI QIDQ3202146zbMATH OpenFDO

Authors Chi Tung Tung, Kim Lin Chew

Publication date 1988

zbMATH Keywords

bicriterion efficient pathheuristicsloopless pathsPareto optimal pathsstrongly connected directed network

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18) Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Cited in

(12)

• The tricriterion shortest path problem with at least two bottleneck objective functions
• A multicriteria Pareto-optimal path algorithm
• A biobjective Dijkstra algorithm
• Multiobjective routing problems
• A label correcting approach for solving bicriterion shortest-path problems
• A relation of dominance for the bicriterion bus routing problem
• A comparison of heuristic best-first algorithms for bicriterion shortest path problems
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• A Bicriteria Approach for Saving a Path Maximizing Dynamic Contraflow
• Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
• A parametric approach to solving bicriterion shortest path problems
• A comparison of solution strategies for biobjective shortest path problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3202146)