scientific article; zbMATH DE number 1783874

zbMath1042.90633MaRDI QIDQ4546246

Anders J. V. Skriver

Publication date: 19 August 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29)

Related Items (16)

Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ On the cardinality of the Pareto set in bicriteria shortest path problems ⋮ Multiple objective minimum cost flow problems: a review ⋮ Analysis of FPTASes for the multi-objective shortest path problem ⋮ Dimensionality reduction in multiobjective shortest path search ⋮ An improved multiobjective shortest path algorithm ⋮ An aggregate label setting policy for the multi-objective shortest path problem ⋮ The Steiner bi-objective shortest path problem ⋮ Generalized nash fairness solutions for bi‐objective minimization problems ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Complexity of strict robust integer minimum cost flow problems: an overview and further results ⋮ A comparison of solution strategies for biobjective shortest path problems ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ A relation of dominance for the bicriterion bus routing problem ⋮ A bicriterion approach for routing problems in multimedia networks ⋮ Bi-criteria path problem with minimum length and maximum survival probability

This page was built for publication: