Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Efficient solution generation for the bicriterion shortest path problems

From MaRDI portal
Publication:606615
Jump to:navigation, search

DOI10.1504/IJOR.2010.035522zbMATH Open1200.90028OpenAlexW2074906378MaRDI QIDQ606615

Abdallah W. Aboutahoun

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



zbMATH Keywords

network optimisationcontinuous relaxationbiobjective shortest path problemBSPPefficient extreme pointsnon-dominated setssimplex based algorithms


Mathematics Subject Classification ID

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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:606615&oldid=12497476"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 08:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki