Summation of the enumerators in the discrete optimization problems

MaRDI QIDQ6145129zbMATH OpenFDO

Authors

Publication date 30 January 2024

Full work available at URL https://diffjournal.spbu.ru/EN/numbers/2023.4/article.1.3.html

zbMATH Keywords

discrete optimizationPareto boundaryenumeratorsmaster data managementsuboptimal problems

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Systems theory; control (93-XX)

Recommendations

• Summation of the enumerators in the discrete optimization problems
• Generalized algorithm for summing the enumerators of suboptimal solutions
• Lösungsverfahren für eine klasse diskreter optimierungsaufgaben spezieller struktur
• Revisiting k-sum optimization
• Problems of discrete optimization: challenges and main approaches to solve them

Cites work

• scientific article; zbMATH DE number 1848058 (Why is no real title available?)
• A Note on an Algebra for the k Best Routes in a Network
• Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
• Methods of constructing suboptimal solutions of the multi-dimensional rucksack problem
• Survey of multi-objective optimization methods for engineering

Cited in

(2)

• Using Bellman optimality principle for the generative autoencoder architecture for the problems of the attribute data typesetting and semantic description in data management
• Summation of the enumerators in the discrete optimization problems

This page was built for publication: Summation of the enumerators in the discrete optimization problems

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