Bicriteria path problem minimizing the cost and minimizing the number of labels
DOI10.1007/S10288-013-0229-0zbMATH Open1277.05156OpenAlexW1973929517MaRDI QIDQ385462FDOQ385462
Authors: Marta M. B. Pascoal, Ana Laranjeira, Maria Eugénia Captivo, Joao Carlos Namorado Climaco 
Publication date: 2 December 2013
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10316/44383
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
Multi-objective and goal programming (90C29) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Extremal problems in graph theory (05C35) Paths and cycles (05C38)
Cites Work
- Network flows. Theory, algorithms, and applications.
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Title not available (Why is that?)
- A bicriterion shortest path algorithm
- A comparison of solution strategies for biobjective shortest path problems
- The minimum labeling spanning trees
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- An aggregate label setting policy for the multi-objective shortest path problem
- 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
- Title not available (Why is that?)
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)
