A computational investigation of linear parametrization of criteria in multicriteria discrete programming

MaRDI QIDQ1264669zbMATH OpenFDO

Authors I. I. Melamed, I. Kh. Sigal

Publication date 7 March 1999

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

bicriteria assignment and covering tree problemslinear parametrizationmulticriteria discrete programmingPareto optimal solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Study of the linear parametrization of criteria in the bicriteria knapsack problem
• scientific article; zbMATH DE number 1157223
• Computational study of a linear convolution of criteria in discrete multicriteria programming
• Some relationships between multicriteria and parametric discrete optimization problems with bottleneck objectives
• The theory of linear parametrization of criteria in multicriteria optimization

Cited in

(8)

• Computational study of a linear convolution of criteria in discrete multicriteria programming
• The theory of linear parametrization of criteria in multicriteria optimization
• Some relationships between multicriteria and parametric discrete optimization problems with bottleneck objectives
• A Survey on Multiple Objective Minimum Spanning Tree Problems
• scientific article; zbMATH DE number 1086937 (Why is no real title available?)
• Threshold robustness in discrete facility location problems: a bi-objective approach
• Particular structures of the Pareto set and its reduction in bicriteria discrete problems
• Study of the linear parametrization of criteria in the bicriteria knapsack problem

This page was built for publication: A computational investigation of linear parametrization of criteria in multicriteria discrete programming

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