An algorithm for solving a class of discrete multicriterion problems

DOI10.1016/S0041-5553(83)80099-8zbMATH Open0584.90091MaRDI QIDQ3710331FDOQ3710331

M. G. Krejnes, N. M. Novikova

Publication date: 1983

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

zbMATH Keywords

monotonic constraintsmulticriterion discrete optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Integer programming (90C10)

Cited In (9)

• On conditions of efficiency of a solution of a multicriteria discrete problem
• A new algorithm for the multi-item exponentially discounted optimal selection problem.
• A survey of interval algorithms for solving multicriteria analysis problems
• Monomial Tropical Cones for Multicriteria Optimization
• Numerical analysis of algorithms for solving bicriteria discrete programming problems
• Algorithms for solving lexicographic multicriterion problems on matroids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• An improved method for solving multiple criteria problems involving discrete alternatives 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Finding the set of alternatives in discrete multicriterion problems 👍 👎
• Solving multiobjective programming problems by discrete representation 👍 👎
• Methods and algorithms for solving multicriteria problems -- classification approach 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Complexity of discrete multicriteria problems 👍 👎

This page was built for publication: An algorithm for solving a class of discrete multicriterion problems

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