Numerical analysis of algorithms for solving bicriteria discrete programming problems

MaRDI QIDQ1608267zbMATH OpenFDO

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

Publication date 23 November 2002

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

zbMATH Keywords

convolutionalgorithmspanningtraveling salesman problemassignmentmulticriteria discrete programmingeffective pointsminsum-min-sum criteria

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• Algorithms for nonlinear integer bicriterion problems
• An algorithm for the bi-criterion integer programming problem
• scientific article; zbMATH DE number 35514
• scientific article; zbMATH DE number 4049388
• Numerical solution of bilinear programming problems
• Algorithm robust for the bicriteria discrete optimization problem
• Numerical solution of a class of bilevel programming problems
• Bicriteria integer quadratic programming problems
• scientific article; zbMATH DE number 3858877
• An algorithm for solving a class of discrete multicriterion problems

Cited in

(3)

• Numerical analysis of tricriteria tree and assignment problems
• Algorithms for nonlinear integer bicriterion problems
• scientific article; zbMATH DE number 3926631 (Why is no real title available?)

This page was built for publication: Numerical analysis of algorithms for solving bicriteria discrete programming problems

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