Methods of constructing argument of objective function in combinatorial optimization problems

DOI10.1023/A:1022944021651MaRDI QIDQ1407089zbMATH OpenOpenAlexFDO

Authors N. K. Timofeeva

Publication date 9 September 2003

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022944021651

zbMATH Keywords

permutationcombinatorial optimizationcombinatorial configurationrecurrent operator

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Formalization and classification of combinatorial optimization problems
• Modified coordinate method to solve multicriteria optimization problems on combinatorial configurations
• Theory and methods of Euclidian combinatorial optimization: current status and prospects
• scientific article; zbMATH DE number 2168886
• Metaheuristic downhill simplex method in combinatorial optimization

Cited in

(3)

• A problem of packing of homothetic convex polytopes
• Ordering a set of values of an objective-function argument in combinatorial optimization
• Formalization and classification of combinatorial optimization problems

This page was built for publication: Methods of constructing argument of objective function in combinatorial optimization problems

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