scientific article; zbMATH DE number 1783874
From MaRDI portal
Publication:4546246
zbMATH Open1042.90633MaRDI QIDQ4546246FDOQ4546246
Authors: Anders J. V. Skriver
Publication date: 19 August 2002
Title of this publication is not available (Why is that?)
Recommendations
Cited In (17)
- Complexity of strict robust integer minimum cost flow problems: an overview and further results
- A bicriterion approach for routing problems in multimedia networks
- A relation of dominance for the bicriterion bus routing problem
- Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
- Generalized nash fairness solutions for bi‐objective minimization problems
- Analysis of FPTASes for the multi-objective shortest path problem
- A comparison of solution strategies for biobjective shortest path problems
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Multiple objective minimum cost flow problems: a review
- Dimensionality reduction in multiobjective shortest path search
- An aggregate label setting policy for the multi-objective shortest path problem
- On the cardinality of the Pareto set in bicriteria shortest path problems
- The Steiner bi-objective shortest path problem
- An improved multiobjective shortest path algorithm
- Bi-criteria path problem with minimum length and maximum survival probability
- Speeding up Martins' algorithm for multiple objective 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 Q4546246)