Dimensionality reduction in multiobjective shortest path search
From MaRDI portal
Publication:342069
DOI10.1016/j.cor.2015.05.007zbMath1349.90742OpenAlexW640136309MaRDI QIDQ342069
José-Luis Pérez-de-la-Cruz, Lawrence Mandow, Francisco Javier Pulido
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.05.007
combinatorial optimizationlower boundsmultiobjective shortest path problemexact label-setting algorithms
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Related Items (3)
Simple and efficient bi-objective search algorithms via fast dominance checks ⋮ Targeted multiobjective Dijkstra algorithm ⋮ A generalized shortest path tour problem with time windows
Cites Work
- Unnamed Item
- Unnamed Item
- A comparison of heuristic best-first algorithms for bicriterion shortest path problems
- An aggregate label setting policy for the multi-objective shortest path problem
- On finding dissimilar Pareto-optimal paths
- On a multicriteria shortest path problem
- The bi-objective covering tour problem
- A comparison of solution strategies for biobjective shortest path problems
- A multicriteria Pareto-optimal path algorithm
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
- Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem
- An empirical investigation of some bicriterion shortest path algorithms
- A label correcting approach for solving bicriterion shortest-path problems
- On the cardinality of the Pareto set in bicriteria shortest path problems
- Multi-objective vehicle routing problems
- A Case of Pathology in Multiobjective Heuristic Search
- Multiobjective A * search with consistent heuristics
- Multiobjective A*
- A bicriterion approach for routing problems in multimedia networks
- Multicriteria path and tree problems: discussion on exact algorithms and applications
- Selected Multicriteria Shortest Path Problems: An Analysis of Complexity, Models and Adaptation of Standard Algorithms
- Label correcting methods to solve multicriteria shortest path problems
This page was built for publication: Dimensionality reduction in multiobjective shortest path search
