Bicriteria path problem minimizing the cost and minimizing the number of labels
From MaRDI portal
Publication:385462
DOI10.1007/s10288-013-0229-0zbMath1277.05156OpenAlexW1973929517MaRDI 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
Extremal problems in graph theory (05C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
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