Modified algorithm to compute Pareto-optimal vectors

DOI10.1023/A:1021737819929MaRDI QIDQ1969470zbMATH OpenOpenAlexFDO

Authors S. Ismail Mohideen, V. Narsimha Sastry

Publication date 16 March 2000

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021737819929

zbMATH Keywords

multiple objectivesmultiple-criteria decision makingnetwork optimizationPareto-minimum vectors

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35)

Recommendations

• On an algorithm for solving a linear vector optimization problem
• New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems
• scientific article; zbMATH DE number 4149833
• scientific article; zbMATH DE number 4160485
• scientific article; zbMATH DE number 175989

Cites work

• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• Shortest paths in networks with vector weights

Cited in

(3)

• Weighting factor extensions for finite multiple objective vector minimization problems
• New algorithms for multi objective shortest path problem.
• New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems

This page was built for publication: Modified algorithm to compute Pareto-optimal vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969470)