Applying multi-criteria optimization for effective combinatorial problem solving

MaRDI QIDQ4035076zbMATH OpenFDO

Authors B. V. Pel'tsverger, O. V. Khavronin

Publication date 18 May 1993

zbMATH Keywords

approximate polynomial algorithmstransport networks synthesis

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Combinatorial optimization (90C27) Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 1157223
• Multicriteria combinatorial optimization problems on a set of polypermutations
• Solution of multicriteria problems of combinatorial optimization on a set of polypermutations
• scientific article; zbMATH DE number 4156211
• Decomposition method of solving a class of combinatorial optimization problems

Cited in

(4)

• A heuristic method for solving integer-valued decompositional multiindex problems
• Multiple-choice decision making by multicriteria combinatorial optimization
• scientific article; zbMATH DE number 4156211 (Why is no real title available?)
• Combinatorial optimization in digital communications

This page was built for publication: Applying multi-criteria optimization for effective combinatorial problem solving

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