Efficient solution generation for the bicriterion shortest path problems
DOI10.1504/IJOR.2010.035522zbMATH Open1200.90028OpenAlexW2074906378MaRDI QIDQ606615
Publication date: 17 November 2010
Published in: International Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijor.2010.035522
network optimisationcontinuous relaxationbiobjective shortest path problemBSPPefficient extreme pointsnon-dominated setssimplex based algorithms
Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)
This page was built for publication: Efficient solution generation for the bicriterion shortest path problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606615)