Bicriteria path problem minimizing the cost and minimizing the number of labels

DOI10.1007/s10288-013-0229-0zbMath1277.05156MaRDI QIDQ385462

Ana Laranjeira, Marta M. B. Pascoal, Joao Carlos Namorado Climaco, Maria Eugénia Captivo

Publication date: 2 December 2013

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/44383

zbMATH Keywords

shortest path; minimal cost; bicriteria; minimal number of labels

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

90C29: Multi-objective and goal programming

90C27: Combinatorial optimization

05C38: Paths and cycles

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• An aggregate label setting policy for the multi-objective shortest path problem
• A comparison of solution strategies for biobjective shortest path problems
• A bicriterion shortest path algorithm
• The minimum labeling spanning trees
• Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization
• On the bicriterion - minimal cost/minimal label - spanning tree problem
• Multicriteria path and tree problems: discussion on exact algorithms and applications