A computational investigation of linear parametrization of criteria in multicriteria discrete programming
From MaRDI portal
Publication:1264669
zbMath0912.65056MaRDI QIDQ1264669
Publication date: 7 March 1999
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Pareto optimal solutionslinear parametrizationmulticriteria discrete programmingbicriteria assignment and covering tree problems
Related Items (2)
Threshold robustness in discrete facility location problems: a bi-objective approach ⋮ A Survey on Multiple Objective Minimum Spanning Tree Problems
This page was built for publication: A computational investigation of linear parametrization of criteria in multicriteria discrete programming