Bicriteria path problem minimizing the cost and minimizing the number of labels
From MaRDI portal
Publication:385462
Recommendations
- On the bicriterion - minimal cost/minimal label - spanning tree problem
- On a multicriteria shortest path problem
- An empirical investigation of some bicriterion shortest path algorithms
- On a special class of bicriterion path problems
- A label correcting approach for solving bicriterion shortest-path problems
Cites work
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3478624 (Why is no real title available?)
- A bicriterion shortest path algorithm
- A comparison of solution strategies for biobjective shortest path problems
- An aggregate label setting policy for the multi-objective shortest path problem
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
- Network flows. Theory, algorithms, and applications.
- On the bicriterion - minimal cost/minimal label - spanning tree problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The minimum labeling spanning trees
Cited in
(2)
This page was built for publication: Bicriteria path problem minimizing the cost and minimizing the number of labels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385462)
