The tricriterion shortest path problem with at least two bottleneck objective functions
From MaRDI portal
Publication:1026760
DOI10.1016/j.ejor.2008.09.036zbMath1163.90794OpenAlexW1987885859MaRDI QIDQ1026760
Cláudio Thomás Bornstein, Leizer de Lima Pinto, Nelson F. Maculan
Publication date: 29 June 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.09.036
Related Items (7)
An aggregate label setting policy for the multi-objective shortest path problem ⋮ Speeding up Martins' algorithm for multiple objective shortest path problems ⋮ Generalized multiple objective bottleneck problems ⋮ 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 ⋮ On algorithms for the tricriteria shortest path problem with two bottleneck objective functions ⋮ Hierarchical Multiobjective Shortest Path Problems
Cites Work
- On a multicriteria shortest path problem
- On a special class of bicriterion path problems
- Shortest paths in networks with vector weights
- Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function
- A bicriterion shortest path algorithm
- A multicriteria Pareto-optimal path algorithm
- Linear multiobjective programming
- The Min-Max Spanning Tree Problem and some extensions
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Multiobjective transportation network design and routing problems: Taxonomy and annotation
- Dioïds and semirings: Links to fuzzy sets and other applications
- New algorithms for multi objective shortest path problem.
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
- On a routing problem
- The Constrained Bottleneck Problem in Networks
- Algorithms for two bottleneck optimization problems
- New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
- Label correcting methods to solve multicriteria shortest path problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The tricriterion shortest path problem with at least two bottleneck objective functions
